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

DOI10.1016/J.DISC.2007.09.054zbMATH Open1158.05034OpenAlexW2075036370MaRDI QIDQ998415FDOQ998415

Authors: 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

Recommendations

• The size of a minimum five-chromatic \(K_ 4\)-free graph
• Each 11-vertex graph without 4-cliques has a triangle-free 2-partition of vertices
• Triangle-free four-chromatic graphs
• scientific article; zbMATH DE number 6667214
• On the chromatic number of triangle-free graphs of large minimum degree

zbMATH Keywords

list coloringtriangle-free graphthe Grötzsch graph

Mathematics Subject Classification ID

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

Cites Work

• Sur le coloriage des graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of planar graph choosability
• Small graphs with chromatic number 5: A computer search
• On the Structure of Dense Triangle-Free Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Each 11-vertex graph without 4-cliques has a triangle-free 2-partition of vertices
• Triangle-free four-chromatic graphs
• The size of a minimum five-chromatic \(K_ 4\)-free graph
• Maximum number of colourings: 4-chromatic graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998415)