## Congressus Numerantium, Volumes 111-112 |

### What people are saying - Write a review

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

### Contents

412 | 48 |

24 | 177 |

Spanning Trees and Vertex Deletion by Gary Haggard | 33 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

13 pairwise 2-disjoint 3-satisfiability adjacency matrix adjacent algorithm assume automorphism bc(G bi(G biclique bipartite graph bounded bitolerance digraph Cayley graph chordal graphs closed neighborhood codes column Combinatorics Computer connected consider construction contains contradiction corresponding CUBE cycle defined denote elements embedding exactly finite fields function Gaussian given graph G graph invariant Graph Theory greatest point Hamiltonian paths Hence Hermite invariant independent set induced subgraph interval graphs isomorphic Jeep labeled Lemma Let G magic Math Mathematics matrix maximal independent set minimal dominating set mm(G monochromatic solution node NP-complete number of edges pair pairwise 2-disjoint SR's path spectrum permutation graphs point of Q polynomial processors Proof Proposition r-regular Ramanujan graphs result sequence set of 13 shown in Figure single arc solution to 5(c SQUARE Steiner Subcases subgraph subset Suppose tankfuls of fuel Theorem torus tournament unit parallelogram graph vector