Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Turán number for the hexagon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(C_ 6\)-free bipartite graphs and product representation of squares / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Four-cycles in graphs without a given even cycle / rank | |||
Normal rank | |||
Revision as of 04:33, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Making a \(C_6\)-free graph \(C_4\)-free and bipartite |
scientific article |
Statements
Making a \(C_6\)-free graph \(C_4\)-free and bipartite (English)
0 references
21 June 2016
0 references
extremal graphs
0 references
bipartite subgraphs
0 references
6-cycles
0 references
4-cycles
0 references
