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

DOI10.1007/S00373-021-02349-YzbMATH Open1479.05181OpenAlexW3189360955MaRDI QIDQ2051889FDOQ2051889

Authors: Shuya Chiba, Akira Saito, Masao Tsugaki, Tomoki Yamashita 

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

Recommendations

• Spanning bipartite graphs with high degree sum in graphs
• Disjoint Hamiltonian cycles in bipartite graphs
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs

zbMATH Keywords

Hamiltonian cyclebipartite graphOre's theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Spanning bipartite graphs with high degree sum in graphs
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs

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

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