### What people are saying - Write a review

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

### Contents

Y Alavi A Boals G Chartrand P Erdos and O Oellermann | 7 |

O Albertson Finding Hamiltonian Cycles in Ore Graphs | 25 |

A T Amin K T Siegrist and P J Slater Exact Formulas | 43 |

Copyright | |

13 other sections not shown

### Common terms and phrases

adjacent ascending subgraph decomposition assume bc(D biclique binary bipartite graph blocking set broadcast BT increments chordal graphs chromatic polynomials collapsible color column combinatorial complete complete graph components Computer conjecture connected construction contains Corollary corresponding cycle cyclic define deleted denote digraph disjoint distance degree sequences domination number duadic codes elementary divisors elements example exists Figure given graph G Graph Theory Greedy Algorithm grid graph Hence hypercube induced subgraph integer interval graph isomorphic labeling Lemma length Let G lower bound Math matrix minimal nodes NP-complete number of vertices obtained optical orthogonal code optimal pair partition perfect graphs permutation graphs planar planar graph plane of order points polygons problem processors Proof quadrangle quasi-ideals result shortest path spanning tree Steiner Steiner tree structure subgraph of G subplanes subset Suppose Theorem tiling pattern values vector vertex vertex sequence vertex set zoo-keeper route