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

DOI10.1016/J.DISC.2023.113692zbMATH Open1525.05101MaRDI QIDQ6080149

Takamasa Yashima, Masao Tsugaki, Tomoki Yamashita, Jun Fujisawa

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphperfect matchingdegree condition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartite graphs with every matching in a cycle
• Spanning Cycles Through Specified Edges in Bipartite Graphs

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)