Hamiltonian and long paths in bipartite graphs with connectivity

DOI10.1016/J.DISC.2022.113083MaRDI QIDQ2675844zbMATH OpenOpenAlexWikidataFDO

Authors Zhiyong Gan, Yanping Xu

Publication date 26 September 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.113083

zbMATH Keywords

\(k\)-extendable graphbipartite graphconnectivityHamiltonian pathHamiltonian-laceable graphlong path

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian and long cycles in bipartite graphs with connectivity
• Hamilton paths in \(n\)-extendable bipartite graphs.
• Hamiltonian paths and hamiltonian connectivity in graphs
• On Hamiltonian bipartite graphs
• scientific article; zbMATH DE number 5931607
• Line graphs of bipartite graphs with Hamiltonian paths
• scientific article; zbMATH DE number 4101247
• On Hamiltonian paths and cycles in sufficiently large distance graphs
• Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
• scientific article; zbMATH DE number 4091550

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 and long cycles in bipartite graphs with connectivity
• Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
• 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.
• On n-extendable graphs
• Recent advances on the Hamiltonian problem: survey III
• Recent Progress in Matching Extension
• Updating the hamiltonian problem—A survey

Cited in

(3)

• Hamiltonian and long cycles in bipartite graphs with connectivity
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Hamilton paths in \(n\)-extendable bipartite graphs.

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

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