## 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 | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

2-connected adjacency matrix algorithm arcs bc(D bc(Dn biclique covering bipartite graph bipartite tournament bp(D Bruijn sequence cardinality channel graph chordal graph circuit circular embeddings clique color common neighbors complete digraph conjecture conjugate connected graph conprimal consistent sets construction Corollary covering number cubic graph decomposable defined definition denote disjoint dominates edge of G edges joining elements endpoints exists EXP(p Figure graph G Graph Theory Hamiltonian path Hamiltonian path problem Hedetniemi Hence homomorphism horizontal extension segments independent set induced intersection k-tree labeled least Lemma lower bound Math Mathieu groups maximum minimum number module n-cycle n-gon n-tuples nodes nonhamiltonian graph number of edges number of vertices obtain partition permutation Petersen graph positive integer problem Proof prove quadrangle rectangular grid graphs result set of edges set of vertices snarks Steinhaus tournaments strength subgraph subset symmetric symmetric graph Theorem topological triangle unimodal upper bound vertex