Hamiltonian and long paths in bipartite graphs with connectivity

DOI10.1016/j.disc.2022.113083zbMath1497.05138OpenAlexW4286483963WikidataQ114190477 ScholiaQ114190477MaRDI QIDQ2675844

Yanping Xu, Zhiyong Gan

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

bipartite graphconnectivityHamiltonian path\(k\)-extendable graphHamiltonian-laceable graphlong path

Mathematics Subject Classification ID

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

Cites Work

• On n-extendable graphs
• Advances on the Hamiltonian problem -- a survey
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Independence number in \(n\)-extendable graphs
• Hamiltonian and long cycles in bipartite graphs with connectivity
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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