Bipartite graphs with every k-matching in a Hamiltonian cycle.

MaRDI QIDQ4568196zbMATH OpenFDO

Authors Miao Wang, Yan Liu

Publication date 15 June 2018

zbMATH Keywords

Hamiltonian cyclebipartite graph\(k\)-matching\(k\)-matching-Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Graphs with every \(k\)-matching in a Hamiltonian cycle
• Bipartite graphs with every matching in a cycle
• Hamiltonian properties and the bipartite independence number
• A sufficient condition for Hamiltonians in balanced bipartite graphs
• scientific article; zbMATH DE number 3847429

Cited in

(8)

• Bipartite Kneser graphs are Hamiltonian
• Graphs with every \(k\)-matching in a Hamiltonian cycle
• Bipartite graphs with every matching in a cycle
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
• Lexicographic matchings cannot form Hamiltonian cycles
• Hamilton cycles passing through a matching in a bipartite graph with high degree sum
• Biclosure and bistability in a balanced bipartite graph

This page was built for publication: Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle.

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