Hamiltonian and long cycles in bipartite graphs with connectivity

DOI10.1016/j.dam.2021.05.027zbMath1466.05114OpenAlexW3166157640WikidataQ114191487 ScholiaQ114191487MaRDI QIDQ2032971

Zhiyong Gan, Yanping Xu

Publication date: 14 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.027

zbMATH Keywords

bipartite graphconnectivityHamiltonian cyclelong cycle\(k\)-extendable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonian and long paths in bipartite graphs with connectivity ⋮ On defect restricted matching extension graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Advances on the Hamiltonian problem -- a survey
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Independence number in \(n\)-extendable graphs
• Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity
• Recent advances on the Hamiltonian problem: survey III
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• Updating the hamiltonian problem—A survey
• Hamiltonian cycles in n‐extendable graphs