Ore and Erdős type conditions for long cycles in balanced bipartite graphs

zbMATH Open1196.05047MaRDI QIDQ3575459FDOQ3575459

Authors: Janusz Adamus, Lech Adamus 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1290/0.html

Recommendations

• A degree condition for cycles of maximum length in bipartite digraphs
• scientific article; zbMATH DE number 140141
• Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen
• On long cycles in a 2-connected bipartite graph
• scientific article; zbMATH DE number 3875321

zbMATH Keywords

bipartite graphcycledegree sumhamiltonicitylong cycle

Mathematics Subject Classification ID

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

Cited In (3)

• Long cycles in graphs and digraphs
• Bipartite graphs with every matching in a cycle
• Finding long cycles in balanced tripartite graphs: a first step

This page was built for publication: Ore and Erdős type conditions for long cycles in balanced bipartite graphs

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