Edge-Hamiltonian property in regular 2-connected graphs

DOI10.1016/0012-365X(90)90042-GMaRDI QIDQ914700zbMATH OpenOpenAlexFDO

Authors Hao Li

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)90042-g

zbMATH Keywords

2-connectedHamiltonian cyclek-regular graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Review text

\textit{B. Jackson} [J. Comb. Theory, Ser. B 29, 27-46 (1980; Zbl 0432.05037)] proved that every 2-connected, k-regular graph with at most 3k vertices is Hamiltonian. The author extends this to the following. Let G be a 2-connected, k-regular graph on n vertices and suppose uv is any edge of G for which \(\{\) u,v\(\}\) is not a cut-set. Then G has a Hamiltonian cycle containing uv if \(n\leq 3k-1\) or if \(n=3k\) and G does not belong to a prescribed class of graphs. The proof is given only for the case \(n\leq 3k-1\); the remainder is said to be available in the Master's thesis of the author.

Recommendations

• scientific article; zbMATH DE number 3966120
• scientific article; zbMATH DE number 3929043
• On regular 2-connected 2-path Hamiltonian graphs
• Hamilton cycles in regular 3-connected graphs
• Hamiltonicity in connected regular graphs

Cites work

• Hamilton cycles in regular 2-connected graphs
• The binding number of a graph and its Anderson number

Cited in

(9)

• scientific article; zbMATH DE number 5631086 (Why is no real title available?)
• scientific article; zbMATH DE number 3929043 (Why is no real title available?)
• scientific article; zbMATH DE number 3966120 (Why is no real title available?)
• Hamiltonian properties of the cube of a 2-edge connected graph
• scientific article; zbMATH DE number 3993619 (Why is no real title available?)
• scientific article; zbMATH DE number 3999970 (Why is no real title available?)
• On regular 2-connected 2-path Hamiltonian graphs
• On regular 2-path Hamiltonian graphs
• Edge bounds in nonhamiltonian k-connected graphs

This page was built for publication: Edge-Hamiltonian property in regular 2-connected graphs

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