The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.09.054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075036370 / rank | |||
Normal rank | |||
Revision as of 23:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) |
scientific article |
Statements
The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (English)
0 references
28 January 2009
0 references
list coloring
0 references
triangle-free graph
0 references
the Grötzsch graph
0 references
