Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions
From MaRDI portal
Removed claims |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2015.06.008 / rank | |||
Property / author | |||
Property / author: Ervin Gyoeri / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.06.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2336338640 / rank | |||
Normal rank | |||
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 | |||
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