Panconnectivity in bipartite graphs with large degree sum

DOI10.1007/S00373-023-02630-2MaRDI QIDQ2698541zbMATH OpenOpenAlexFDO

Authors Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Publication date 24 April 2023

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

Full work available at URL https://doi.org/10.1007/s00373-023-02630-2

zbMATH Keywords

bipartite graphvertex-pancyclicdegree sum conditionpanconnected

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• A panconnectivity theorem for bipartite graphs
• scientific article; zbMATH DE number 140141
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• A new result about panconnectivity on graphs
• Cyclability and pancyclability in bipartite graphs

Cites work

• scientific article; zbMATH DE number 1289752 (Why is no real title available?)
• A panconnectivity theorem for bipartite graphs
• Biclosure and bistability in a balanced bipartite graph
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs
• Graph theory
• On Hamiltonian bipartite graphs
• Path connected graphs

Cited in

(4)

• scientific article; zbMATH DE number 7084989 (Why is no real title available?)
• The bipanconnectivity of bipartite hypercube-like networks
• A new result about panconnectivity on graphs
• A panconnectivity theorem for bipartite graphs

This page was built for publication: Panconnectivity in bipartite graphs with large degree sum

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