The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2007.09.054 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2007.09.054 / rank | |||
Normal rank | |||
Latest revision as of 13:07, 10 December 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
