Edge bounds in nonhamiltonian \(k\)-connected graphs

DOI10.1016/j.disc.2006.09.008zbMath1123.05051OpenAlexW2057771501MaRDI QIDQ879332

Owen D. Byer, Deirdre Longacher Smeltzer

Publication date: 11 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.008

zbMATH Keywords

Hamiltonian3-connectedextremal graph\(k\)-connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items

Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs ⋮ The first zagreb index and some hamiltonian properties of the line graph of a graph ⋮ Proper Hamiltonian cycles in edge-colored multigraphs ⋮ Unnamed Item ⋮ Proper Hamiltonian paths in edge-coloured multigraphs ⋮ Harary index and some Hamiltonian properties of graphs ⋮ Cyclability, connectivity and circumference ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Eigenvalues, Laplacian eigenvalues, and Hamiltonian connectivity of graphs ⋮ Some topological indices and graph properties

Cites Work

• Hamilton connected graphs
• A generalization of a result of Häggkvist and Nicoghossian
• A method in graph theory
• Advances on the Hamiltonian problem -- a survey
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Updating the hamiltonian problem—A survey
• Cyclability of 3-connected graphs