The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the Structure of Dense Triangle-Free Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4379734 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of planar graph choosability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4388209 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small graphs with chromatic number 5: A computer search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur le coloriage des graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4248539 / rank | |||
Normal rank |
Latest revision as of 01:07, 29 June 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