Edge bounds in nonhamiltonian k-connected graphs

DOI10.1016/J.DISC.2006.09.008zbMATH Open1123.05051OpenAlexW2057771501MaRDI QIDQ879332FDOQ879332

Authors: 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

Recommendations

• On the extremal number of edges in Hamiltonian connected graphs
• The maximum size of a nonhamiltonian graph with given order and connectivity
• Edge-Hamiltonian property in regular 2-connected graphs
• scientific article; zbMATH DE number 3966120
• Hamilton cycles in regular 3-connected graphs

zbMATH Keywords

Hamiltonianextremal graph\(k\)-connected3-connected

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
• Maximum graphs non-Hamiltonian-connected from a vertex
• Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs
• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• Proper Hamiltonian cycles in edge-colored multigraphs
• Title not available (Why is that?)
• Eigenvalues, Laplacian eigenvalues, and Hamiltonian connectivity of graphs
• Cyclability, connectivity and circumference
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
• Harary index and some Hamiltonian properties of graphs
• On the extremal number of edges in Hamiltonian connected graphs
• Bounding \(\ell\)-edge-connectivity in edge-connectivity
• The first zagreb index and some hamiltonian properties of the line graph of a graph
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• Some topological indices and graph properties
• The maximum size of a nonhamiltonian graph with given order and connectivity
• Extremal graphs with given stability number and connectivity. I

This page was built for publication: Edge bounds in nonhamiltonian \(k\)-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879332)