Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs

DOI10.1016/J.DISC.2023.113446MaRDI QIDQ6041867zbMATH OpenOpenAlexFDO

Authors Ruixia Wang, Zhiyi Zhou

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

balanced bipartite graphdegree sum conditionHamiltonian cycle

Mathematics Subject Classification ID

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

Recommendations

• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• scientific article; zbMATH DE number 786226
• scientific article; zbMATH DE number 3847429
• A sufficient condition for Hamiltonians in balanced bipartite graphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs

Cites work

• An efficient condition for a graph to be Hamiltonian
• Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
• Bipartite graphs with every k-matching in a Hamiltonian cycle.
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
• Graph theory with applications
• scientific article; zbMATH DE number 54809 (Why is no real title available?)
• scientific article; zbMATH DE number 1289752 (Why is no real title available?)
• New sufficient conditions for bipancyclic bipartite graphs
• New sufficient conditions for cycles in graphs
• Note on Hamilton Circuits
• On Hamiltonian bipartite graphs
• Pancyclic graphs. I

Cited in

(14)

• A condition for a Hamiltonian bipartite graph to be bipancyclic
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• Spanning bipartite graphs with high degree sum in graphs
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• A sufficient condition for Hamiltonians in balanced bipartite graphs
• Degree sum conditions for cyclability in bipartite graphs
• scientific article; zbMATH DE number 140141 (Why is no real title available?)
• scientific article; zbMATH DE number 1766895 (Why is no real title available?)
• scientific article; zbMATH DE number 786226 (Why is no real title available?)
• Hamilton cycles passing through a matching in a bipartite graph with high degree sum
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph
• Edge-bipancyclicity of hypercubes with faulty edges
• On sufficient degree conditions for a graph to be disjoint path coverable

This page was built for publication: Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs

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