×

A structural method for hamiltonian graphs. (English) Zbl 0833.05057

A characterization of hamiltonian graphs in terms of a partition of the vertices of the graph into a complete subgraph and a set of additional vertex disjoint subgraphs which have special properties relative to their neighborhoods in the complete subgraph is given. This characterization is then used to generalize some known results on hamiltonian graphs using a Fan type condition, such as the result of P. Bedrossian, G. Chen and R. H. Schelp [Discrete Math. 115, No. 1-3, 39-50 (1993; Zbl 0773.05075)].

MSC:

05C45 Eulerian and Hamiltonian graphs

Citations:

Zbl 0773.05075
PDF BibTeX XML Cite