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

MaRDI QIDQ3575459zbMATH OpenFDO

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

zbMATH Keywords

bipartite graphcycledegree sumhamiltonicitylong cycle

Mathematics Subject Classification ID

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

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

Cited in

(3)

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

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)