Cycles in bipartite graphs
From MaRDI portal
Cites work
Cited in
(27)- Long cycles in bipartite graphs
- The structure of hypergraphs without long Berge cycles
- On the Ramsey numbers of odd-linked double stars
- Super-pancyclic hypergraphs and bipartite graphs
- Conditions for a bigraph to be super-cyclic
- An exact formula for all star-kipas Ramsey numbers
- 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
- On star-wheel Ramsey numbers
- All Ramsey numbers for brooms in graphs
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Longest cycles in 3‐connected hypergraphs and bipartite graphs
- Exact bipartite Turán numbers of large even cycles
- The bipartite Turán number and spectral extremum for linear forests
- Bipartite Ramsey numbers of cycles
- Pósa-type results for Berge hypergraphs
- The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\)
- The structure of hypergraphs without long Berge cycles
- On the Turán numbers of linear forests in bipartite graphs
- On the Ramsey numbers of even-linked double stars
- On tree-wheel Ramsey numbers
- Star-critical Ramsey numbers of cycles revisited
- Ramsey numbers of trees versus generalized wheels
- Extremal graphs for even linear forests in bipartite graphs
- The bipartite Turán number of independent cycles with different lengths
- Ore-type condition for longest cycles in hypergraphs and bipartite graphs
- Three results on cycle-wheel Ramsey numbers
This page was built for publication: Cycles in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156150)