Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
From MaRDI portal
Publication:6041867
DOI10.1016/J.DISC.2023.113446zbMATH Open1514.05090OpenAlexW4366155343MaRDI QIDQ6041867FDOQ6041867
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
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
Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Pancyclic graphs. I
- Graph theory with applications
- Note on Hamilton Circuits
- New sufficient conditions for cycles in graphs
- On Hamiltonian bipartite graphs
- An efficient condition for a graph to be Hamiltonian
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
- New sufficient conditions for bipancyclic bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle.
Cited In (11)
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton cycles passing through a matching in a bipartite graph with high degree sum
- A sufficient condition for Hamiltonians in balanced bipartite graphs
- A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
- Spanning bipartite graphs with high degree sum in graphs
- Degree sum conditions for cyclability in bipartite graphs
- Title not available (Why is that?)
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)
