Hamiltonian and long cycles in bipartite graphs with connectivity
DOI10.1016/J.DAM.2021.05.027zbMATH Open1466.05114OpenAlexW3166157640WikidataQ114191487 ScholiaQ114191487MaRDI QIDQ2032971FDOQ2032971
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
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
Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- On n-extendable graphs
- Title not available (Why is that?)
- Hamiltonian cycles in n‐extendable graphs
- Recent advances on the Hamiltonian problem: survey III
- Graph Factors and Matching Extensions
- Advances on the Hamiltonian problem -- a survey
- Updating the hamiltonian problem—A survey
- Recent Progress in Matching Extension
- Connectivity of \(k\)-extendable graphs with large \(k\).
- Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity
- Independence number in \(n\)-extendable graphs
- On the structure of minimally \(n\)-extendable bipartite graphs
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles
- Hamilton cycles in \(n\)-extendable bipartite graphs.
- Hamilton paths in \(n\)-extendable bipartite graphs.
- Long cycles in \(n\)-extendable bipartite graphs.
Cited In (7)
- Title not available (Why is that?)
- 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 defect restricted matching extension graphs
- Hamiltonian and long paths in bipartite graphs with connectivity
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
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)
