A simple proof of a theorem of Jung

DOI10.1016/0012-365X(90)90029-HzbMath0707.05045OpenAlexW2071166679MaRDI QIDQ918991

Aurora Morgana, Edward F. Schmeichel, Douglas Bauer

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90029-h

zbMATH Keywords

Hamiltonian graph1-tough graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Toughness in graphs -- a survey ⋮ Long cycles in graphs with large degree sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• Tough graphs and Hamiltonian circuits.
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• On Maximal Circuits in Finite Graphs
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree

This page was built for publication: A simple proof of a theorem of Jung