Hamilton Cycles, Minimum Degree, and Bipartite Holes
From MaRDI portal
Publication:4596314
DOI10.1002/jgt.22114zbMath1375.05160arXiv1604.00888OpenAlexW2963440011MaRDI QIDQ4596314
Nikola Yolov, Colin J. H. McDiarmid
Publication date: 1 December 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.00888
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (6)
Hamilton-connected, vertex-pancyclic and bipartite holes ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Random perfect graphs ⋮ Random graph's Hamiltonicity is strongly tied to its minimum degree ⋮ Locating any two vertices on Hamiltonian cycles in large graphs
This page was built for publication: Hamilton Cycles, Minimum Degree, and Bipartite Holes
