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

DOI10.1016/j.disc.2023.113446zbMath1514.05090OpenAlexW4366155343MaRDI QIDQ6041867

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

Hamiltonian cycledegree sum conditionbalanced bipartite graph

Mathematics Subject Classification ID

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

Related Items (1)

A sufficient condition for vertex bipancyclicity in balanced bipartite graphs

Cites Work

• Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
• New sufficient conditions for cycles in graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• New sufficient conditions for bipancyclic bipartite graphs
• An efficient condition for a graph to be Hamiltonian
• Pancyclic graphs. I
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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