Hamilton cycles in almost-regular 2-connected graphs

DOI10.1006/JCTB.1993.1007MaRDI QIDQ757425zbMATH OpenOpenAlexFDO

Authors Bill Jackson

Publication date 1993

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1993.1007

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Review text

Let \(k\) and \(s\) be integers, \(1\leq s\leq 4\). Let \(G\) be a graph whose vertices have degrees between \(k\) and \(k+s\), and \(| G| \leq 3k-c(s),\) \(1\leq s\leq 3\), or \(| G| \leq 2.5k-c(s),\) \(s=4\) for suitable constants \(c(s)\) depending on \(s\). We obtain a necessary and sufficient condition for \(G\) to be hamiltonian. In particular we show that if \(s=1\) and \(n=| G| \leq 3k-1\) then \(G\) is hamiltonian unless \(n\) is odd and \(\alpha (G)=1/2(n+1).\)

Recommendations

• Hamiltonian cycles in regular graphs of moderate degree
• Hamilton cycles in regular 3-connected graphs
• scientific article; zbMATH DE number 3966120
• scientific article; zbMATH DE number 147627
• scientific article; zbMATH DE number 205869

Cited in

(7)

• Hamiltonian cycles in regular graphs
• Hamiltonian cycles in regular graphs of moderate degree
• On Hamiltonicity of regular graphs with bounded second neighborhoods
• The total chromatic number of regular graphs of even order and high degree
• Hamilton cycles in almost distance-hereditary graphs
• scientific article; zbMATH DE number 4065032 (Why is no real title available?)
• Loose Hamilton Cycles in Regular Hypergraphs

This page was built for publication: Hamilton cycles in almost-regular 2-connected graphs

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