Combinatorics and graph theory Page 2 Undergraduate Texts in Mathematics Editors S. Axler
KA Ribet For other titles published in this series, go to http://www. springer. com/series/666 …

This article is intended as a survey, updating earlier surveys in the area. For completeness
of the presentation of both particular questions and the general area, it also contains …

Claw-free graphs — A survey - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …

This is intended as a survey article covering recent developments in the area of hamiltonian
graphs, that is, graphs containing a spanning cycle. This article also contains some material …

In this paper we characterize those pairs of forbidden subgraphs sufficient to imply various
hamiltonian type properties in graphs. In particular, we find all forbidden pairs sufficient …

We study the stability of some classes of graphs defined in terms of forbidden subgraphs
under the closure operation introduced by the second author. Using these results, we prove …

We say a graph G is minimal with respect to a property Q if there exists no proper induced
subgraph G′ of G with property Q. In this paper we characterize all minimal graphs with …

A graph G on n vertices is pancyclic if G contains cycles of all lengthsfor 3n and G is cycle
extendable if for every nonhamiltonian cycle CG there is a cycle C0 G such that V (C) V (C0) …

It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1
consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected …

We study the stability of some classes of claw-free graphs defined in terms of forbidden
subgraphs under the closure operation defined in [10]. We characterize all connected …