## Congressus Numerantium, Volumes 115-116 |

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

An Update by Michael D Plummer | 3 |

Forbidden Subgraphs and Hamiltonian Properties A Survey by Ralph Faudree | 33 |

Hamiltonicity in Some Special Classes of Graphs by Linda Lesniak | 71 |

Copyright | |

6 other sections not shown

### Other editions - View all

### Common terms and phrases

2-extendable 3-connected adjacent algorithm Beineke bipartite graphs Cayley graphs Cayley map characterization Chartrand chromatic number claw-free graphs clique coloring Combinatorial complete graph components connected graph Corollary crossing number decomposition defined denote digraph Dirac Discrete Math distinct vertices dominating set domination number Erdos exists fc-extendable finite forbidden subgraphs G is hamiltonian genus graph embedded graph G graph of order Graph Theory Hadwiger Hadwiger's Conjecture Halin hamilton cycle Hamiltonian cycles Hamiltonian path Harary Hence hypergraphs imbedding implies independent induced subgraph intersection graphs isomorphic Landau's least Lemma Let G line graphs lower bound matching maximum number minimum degree node nonorientable NP-complete number of edges number of vertices obtained orientable pair pancyclic planar graphs polynomial poset positive integer Preprint problem proof proved random graph result score sequence Section semicomplete digraph showed spanning subset surface Theorem Thomassen thrackle topological tournament of order triangles upper bound vertex set