Hamilton cycles passing through a matching in a bipartite graph with high degree sum

DOI10.1016/J.DISC.2023.113692MaRDI QIDQ6080149zbMATH OpenFDO

Authors Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Publication date 30 October 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2023.113692

zbMATH Keywords

bipartite graphdegree conditionperfect matching

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
• Bipartite graphs with every k-matching in a Hamiltonian cycle.
• scientific article; zbMATH DE number 3847429
• Ciclos hamiltonianos que pasan a través de un bosque lineal en grafos bipartitos balanceados
• Degree sum conditions for Hamiltonicity on \(k\)-partite graphs

Cites work

• Bipartite graphs with every matching in a cycle
• Graph theory
• scientific article; zbMATH DE number 3722690 (Why is no real title available?)
• scientific article; zbMATH DE number 3298608 (Why is no real title available?)
• Spanning cycles through specified edges in bipartite graphs

Cited in

(1)

• Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph

This page was built for publication: Hamilton cycles passing through a matching in a bipartite graph with high degree sum

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