Hamilton cycles in split graphs with large minimum degree

DOI10.7151/DMGT.1210MaRDI QIDQ4823291zbMATH OpenOpenAlexFDO

Authors Ngo Dac Tan, Le Xuan Hung

Publication date 27 October 2004

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1210

zbMATH Keywords

bipartite graphsplit graphHamilton cycleHamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• Hamiltonian cycles in critical graphs with large maximum degree
• Hamiltonicity in Split Graphs - A Dichotomy
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
• scientific article; zbMATH DE number 3916312
• Hamilton cycles, minimum degree, and bipartite holes
• Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
• Large sets of Hamilton cycle decompositions of complete bipartite graphs
• Cycles in Hamiltonian graphs of prescribed maximum degree
• Hamiltonian cycles in bipartite graphs
• Minimum multiplicities of subgraphs and Hamiltonian cycles

Cited in

(5)

• Hamiltonicity in Split Graphs - A Dichotomy
• On the Burkard-Hammer condition for Hamiltonian split graphs
• On the Hamiltonian and classification problems for some families of split graphs
• The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs
• The chromaticity of complete split graphs

This page was built for publication: Hamilton cycles in split graphs with large minimum degree

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