A note on dominating cycles in 2-connected graphs

DOI10.1016/0012-365X(94)00364-OzbMath0864.05052OpenAlexW2079553117MaRDI QIDQ1923475

Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman

Publication date: 22 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00364-o

zbMATH Keywords

Hamiltonian graphlongest cycledominating cycles2-connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Toughness in graphs -- a survey

Cites Work

• Long cycles in graphs with large degree sums
• Recognizing tough graphs is NP-hard
• Existence of dominating cycles and paths
• Hamiltonian properties of graphs with large neighborhood unions
• A lower bound for the circumference of a graph
• Long cycles, degree sums and neighborhood unions
• Large cycles in graphs
• Tough graphs and Hamiltonian circuits.
• On Maximal Circuits in Finite Graphs
• Toughness, minimum degree, and the existence of 2‐factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item