## Congressus Numerantium, Volume 66 |

### What people are saying - Write a review

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

### Related books

Introduction to Design & Analysis of Algorithms: For Anna University, 2/e Anany V. Levitin No preview available - 2009 |

### Contents

J Buhler P Chinn R Richter and M Truszczynski | 5 |

R B Maddox On kdependent Subsets and Partitions of kdegenerate Graphs | 11 |

S Fajtlowicz On Conjectures of Graffiti ID | 32 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

2-outer planar graphs 3-connected minor adjacent algorithm biconformable bipartite broadcast canonical ordered edge caterpillar Cayley diagram CGO output chordal graphs chromatic number circuit clique partition cocircuit colour complete graph Computer conjecture connected construction contains cycle dancers defined deleted denote distance one realizable edge-disjoint elements embedding endpoint example exists finite fields follows fractional GALOIS GF(q given graph G Graph Theory Hadamard matrices Hence input integer isomorphic k-campaign graph Kautz Kautz graphs label least Lemma Let G line digraph log2n Mathematics matrix matroid maximal maximal independent set minimal multiset neighbor networks nodes nonsimplicial NP-hard number of vertices obtained ordered edge cover pairwise partial 3-trees path planar graph polynomial primal graphs primitive polynomial problem result sequence set-up simplicial SPREMB square dance square roots Steinhaus graph subsets Suppose total chromatic Type UB-graph undirected undirected graph upper bound graphs vertex vertex-colouring