Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Contractible edges in longest cycles in non-Hamiltonian graphs |
scientific article |
Statements
Contractible edges in longest cycles in non-Hamiltonian graphs (English)
0 references
3 November 1994
0 references
This paper addresses the question of how contractible edges are distributed in longest cycles in 3-connected graphs. It establishes the fact that in non-Hamiltonian 3-connected graphs, each longest cycle includes at least 6 contractible edges. An edge in a 3-connected graph is called contractible if the graph obtained from the contraction of the edge is also 3-connected.
0 references
contractible edges
0 references
longest cycles
0 references
non-Hamiltonian
0 references