Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2015.06.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.06.008 / rank | |||
Normal rank | |||
Latest revision as of 13:44, 9 December 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
