## Congressus numerantium, Volume 53 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Archdeacon Coverings of Graphs by Cycles | 7 |

Abello Algorithms for Consistent Sets | 23 |

Archdeacon and B Richter Circuits in 4Regular Plane Graphs | 39 |

Copyright | |

17 other sections not shown

### Common terms and phrases

additive permutations adjacency matrix adjacent algorithm bc(D biclique biclique covering binary bipartite graph blocks chordal graph chromatic polynomial clique color complete graph configuration conjecture connected graph conprimal consider construct contains Corollary cubic graph cycle decomposition defined definition degree denote digraph disjoint dominates elements embedding endpoints example exists Figure finite graph G Graph Theory grid graphs Hamiltonian path Hence implies independent set induced induced subgraph isomorphic latin squares least Lemma Let G linear lines Math matrix matroid maximal maximum minimal minimum number nodes NP-complete number of edges number of vertices obtained oval P-bipartition pair partition permutation graphs Petersen graph planar graphs points polygon prime problem processors Proof Proposition prove quadrangle rectangles rectangular grid graphs relation result satisfies set of vertices spanning tree Steinhaus tournaments subgraph subplane subset Suppose Theorem transitive values vertex