Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
Normal rank | |||
Revision as of 02:34, 11 February 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
