A cycle structure theorem for Hamiltonian graphs (Q1085183): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(88)90058-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2985590381 / rank
 
Normal rank

Revision as of 22:43, 19 March 2024

scientific article
Language Label Description Also known as
English
A cycle structure theorem for Hamiltonian graphs
scientific article

    Statements

    A cycle structure theorem for Hamiltonian graphs (English)
    0 references
    1988
    0 references
    An n-vertex graph is called pancyclic if it contains a cycle of length \(\ell\) for every \(\ell\) such that \(3\leq \ell \leq n.\) We establish the following result: Let C be a hamiltonian cycle in an n- vertex graph G. Suppose C contains consecutive vertices x,y such that \(d(x)+d(y)\geq n\). Then G is either (i) pancyclic, (ii) bipartite, or (iii) missing only an (n-1)-cycle. Moreover, (iii) can only occur if G has a very explicit structure ''near'' x and y. This result can be used to show that three well-known hamiltonian degree conditions (due to Chvátal, Fan, and Bondy) actually imply that a graph is essentially pancyclic.
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian cycle
    0 references
    Hamiltonian degree conditions
    0 references
    0 references
    0 references
    0 references