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

DOI10.1016/J.DISC.2007.09.054zbMath1158.05034OpenAlexW2075036370MaRDI QIDQ998415

Baoyindureng Wu, Li Zhang

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.054

zbMATH Keywords

triangle-free graphlist coloringthe Grötzsch graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Maximum number of colourings: 4-chromatic graphs

Cites Work

• The complexity of planar graph choosability
• On the Structure of Dense Triangle-Free Graphs
• Small graphs with chromatic number 5: A computer search
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)