Hamiltonian and long cycles in bipartite graphs with connectivity

DOI10.1016/J.DAM.2021.05.027MaRDI QIDQ2032971zbMATH OpenOpenAlexWikidataFDO

Authors 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

\(k\)-extendable graphsbipartite graphconnectivityHamiltonian cyclelong cycle

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian and long paths in bipartite graphs with connectivity
• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• Hamilton cycles in \(n\)-extendable bipartite graphs.
• Long cycles in \(n\)-extendable bipartite graphs.
• On long cycles in a 2-connected bipartite graph

Cites work

• Advances on the Hamiltonian problem -- a survey
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Graph Factors and Matching Extensions
• Graph theory
• Hamilton cycles in \(n\)-extendable bipartite graphs.
• Hamilton paths in \(n\)-extendable bipartite graphs.
• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• Hamiltonian cycles in n‐extendable graphs
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• Independence number in n-extendable graphs
• Long cycles in \(n\)-extendable bipartite graphs.
• M-alternating Hamilton paths and M-alternating Hamilton cycles
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Recent advances on the Hamiltonian problem: survey III
• Recent Progress in Matching Extension
• Updating the hamiltonian problem—A survey

Cited in

(7)

• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• Hamiltonian and long paths in bipartite graphs with connectivity
• scientific article; zbMATH DE number 5931607 (Why is no real title available?)
• Hamilton cycles in \(n\)-extendable bipartite graphs.
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• Long cycles in \(n\)-extendable bipartite graphs.
• On defect restricted matching extension graphs

This page was built for publication: Hamiltonian and long cycles in bipartite graphs with connectivity

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