Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)

DOI10.1007/BF01899448zbMath0495.05042OpenAlexW2005741846MaRDI QIDQ1169481

Heinz A. Jung, Chie Nara

Publication date: 1982

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01899448

zbMATH Keywords

Hamilton cycleOre-condition

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Updating the hamiltonian problem—A survey ⋮ Berge cycles in non-uniform hypergraphs

Cites Work

• Unnamed Item
• Note on Hamilton Circuits
• On Maximal Circuits in Finite Graphs

This page was built for publication: Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)