## Congressus Numerantium, Volumes 109-110 |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

1-factor 2-connected 2-packing 2,3)-regular graph 3-cycle adjacent AJ(G ALGS arcs assume Aut(T binary trees br(M chordal graphs clamp clique coloring Combinatorial complete graph Computer condition Congressus Numerantium connected consider construction contradiction Corollary corresponding critical set cubic graph defined denote dependency graph diagonal disjoint distance dominating set dp(G elements elimination ordering endpoints equal equipackable graph example exists Figure genetic algorithm given graph G graph of girth Graph Theory grippers Hamilton cycles hamiltonian Hence implies independent set induced subgraph integer intersection digraph interval graphs isomorphic labels latin square least Lemma Let G level graph Math matrix matroids minimum number neighbors nodes NP-complete number of vertices obtain optimal outdegree pair paired-dominating pancyclic parameters partition path sequence perfect graphs Petersen graphs polynomial problem processors properties Proposition replication numbers representation result Sense of Direction set of vertices strategy subgroup subsets Suppose Symmetric triangle-free graphs triangulations vertex set