Premium
On hamiltonian properties of 2‐tough graphs
Author(s) -
Bauer D.,
Broersma H. J.,
Van Den Heuvel J.,
Veldman H. J.
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180602
Subject(s) - mathematics , conjecture , combinatorics , hamiltonian path , hamiltonian (control theory) , quartic graph , graph , hamiltonian path problem , discrete mathematics , cubic graph , line graph , graph power , voltage graph , mathematical optimization
Abstract A well‐known conjecture in hamiltonian graph theory states that every 2‐tough graph is hamiltonian. We give some equivalent conjectures, e.g., the conjecture that every 2‐tough graph is hamiltonian‐connected.