Hamilton cycles in 2-connected regular bipartite graphs

DOI10.1006/JCTB.1994.1067zbMath0807.05051OpenAlexW2022650779MaRDI QIDQ1338315

Bill Jackson, Hao Li

Publication date: 2 March 1995

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

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

zbMATH Keywords

upper boundHamiltonian graphHamilton cycles\(k\)-regular bipartite graphHäggkvist's conjecture

Mathematics Subject Classification ID

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

Related Items (10)

Cycle partitions of regular graphs ⋮ Binding number, minimum degree and bipancyclism in bipartite graphs ⋮ Maximal sets of Hamilton cycles inKn,n ⋮ The robust component structure of dense regular graphs and applications ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Exact bipartite Turán numbers of large even cycles ⋮ A note on graphs contraction-critical with respect to independence number ⋮ Some properties of graphs constructed from 2-designs ⋮ Weakly bipancyclic bipartite graphs ⋮ Unnamed Item

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