Spanning bipartite graphs with large degree sum in graphs of odd order

DOI10.1007/S00373-021-02349-YzbMath1479.05181OpenAlexW3189360955MaRDI QIDQ2051889

Masao Tsugaki, Akira Saito, Tomoki Yamashita, Shuya Chiba

Publication date: 25 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02349-y

zbMATH Keywords

bipartite graphHamiltonian cycleOre's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs
• Spanning bipartite graphs with high degree sum in graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits

This page was built for publication: Spanning bipartite graphs with large degree sum in graphs of odd order