On the maximum number of independent cycles in a bipartite graph

DOI10.1006/jctb.1996.0037zbMath0859.05054OpenAlexW2041660565MaRDI QIDQ1924141

Hong Wang

Publication date: 7 April 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0037

zbMATH Keywords

bipartite graphindependent cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (21)

Cycles of Given Size in a Dense Graph ⋮ Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ The confirmation of a conjecture on disjoint cycles in a graph ⋮ The edge condition for independent cycles with chords in bipartite graphs ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ Vertex-disjoint cycles of the same length. ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ On vertex-disjoint triangles in tripartite graphs and multigraphs ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ Ore-type conditions for bipartite graphs containing hexagons ⋮ A degree condition of 2-factors in bipartite graphs ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ Vertex-disjoint double chorded cycles in bipartite graphs ⋮ Partial Degree Conditions and Cycle Coverings ⋮ On Enomoto's problems in a bipartite graph ⋮ Vertex-disjoint 4-cycles containing specified edges in a bipartite graph ⋮ Vertex-disjoint hexagons with chords in a bipartite graph ⋮ Triangles in claw-free graphs ⋮ On quadrilaterals in a graph ⋮ On the maximum number of independent cycles in a graph

This page was built for publication: On the maximum number of independent cycles in a bipartite graph