On the Number of Hamiltonian Cycles in Bipartite Graphs

DOI10.1017/S0963548300002182zbMath0868.05034MaRDI QIDQ2785376

Carsten Thomassen

Publication date: 18 August 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

bipartite graphHamiltonian graphHamiltonian cycle

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

Regular Graphs with Few Longest Cycles ⋮ A bibliography on chromatic polynomials ⋮ Chromatic properties of Hamiltonian graphs ⋮ Independent dominating sets and a second hamiltonian cycle in regular graphs ⋮ Chords of longest cycles in cubic graphs ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ 2-factor Hamiltonian graphs. ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ Long cycles in Hamiltonian graphs ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ Chords in longest cycles ⋮ What is on his mind? ⋮ Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs ⋮ Graphs with few hamiltonian cycles ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ Chromatic roots and Hamiltonian paths ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4

Cites Work

• Girth in graphs
• Spanning cycles of nearly cubic graphs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• On Hamiltonian Circuits

This page was built for publication: On the Number of Hamiltonian Cycles in Bipartite Graphs