The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:53, 6 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
    0 references
    0 references
    28 January 2009
    0 references
    0 references
    list coloring
    0 references
    triangle-free graph
    0 references
    the Grötzsch graph
    0 references