Pages that link to "Item:Q4667796"
From MaRDI portal
The following pages link to Four-cycles in graphs without a given even cycle (Q4667796):
Displaying 11 items.
- Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- On subgraphs of \(C_{2k}\)-free graphs (Q1689968) (← links)
- The number of 4-cycles in triangle-free oriented graphs (Q1897447) (← links)
- Subdivisions of a large clique in \(C_6\)-free graphs (Q2343284) (← links)
- On the Turán number for the hexagon (Q2497327) (← links)
- On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
- (Q4657592) (← links)
- On subgraphs of <i>C</i><sub>2<i>k</i></sub>-free graphs and a problem of Kühn and Osthus (Q4993100) (← links)
- On 4-connected graphs without even cycle decompositions (Q5936064) (← links)
