Cycles in bipartite graphs

DOI10.1016/0095-8956(81)90050-2zbMath0468.05048OpenAlexW1996876916MaRDI QIDQ1156150

Bill Jackson

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90050-2

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (16)

An exact formula for all star-kipas Ramsey numbers ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ On star-wheel Ramsey numbers ⋮ All Ramsey numbers for brooms in graphs ⋮ On the Ramsey numbers of odd-linked double stars ⋮ Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles ⋮ The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheels ⋮ Longest cycles in 3‐connected hypergraphs and bipartite graphs ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Three results on cycle-wheel Ramsey numbers ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Bipartite Ramsey numbers of cycles ⋮ Super-pancyclic hypergraphs and bipartite graphs ⋮ Conditions for a bigraph to be super-cyclic ⋮ The structure of hypergraphs without long Berge cycles ⋮ Long cycles in bipartite graphs

Cites Work

• On Minimal graphs of maximum even girth
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles in bipartite graphs