Cyclability in bipartite graphs

DOI10.7494/OPMATH.2009.29.4.345MaRDI QIDQ3561532zbMATH OpenOpenAlexFDO

Authors Evelyne Flandrin, Grzegorz Gancarzewicz, Denise Amar

Publication date 25 May 2010

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/opmath.2009.29.4.345

zbMATH Keywords

bipartite graphscyclesgraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Cyclability and pancyclability in bipartite graphs
• A fan-type condition for cyclability
• Degree sum conditions for cyclability in bipartite graphs
• Cyclable sets of vertices in 3-connected graphs
• scientific article; zbMATH DE number 5371443

Cited in

(10)

• Bi-cycle extendable through a given set in balanced bipartite graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Cycles in 2-factors of balanced bipartite graphs
• On the cyclability of graphs
• Cyclic separability in graphs
• Degree sum conditions for cyclability in bipartite graphs
• scientific article; zbMATH DE number 4106890 (Why is no real title available?)
• Cyclability and pancyclability in bipartite graphs
• A characterization of cycle-forced bipartite graphs
• Cyclability in graph classes

This page was built for publication: Cyclability in bipartite graphs

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