The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
type: Item
instance of: scholarly article
title: The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
zbMATH Open document ID: 1158.05034
author: Baoyindureng Wu
author: Li Zhang
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5499811
zbMATH Keywords: list coloring
zbMATH Keywords: triangle-free graph
zbMATH Keywords: the Grötzsch graph
MaRDI profile type: Publication
full work available at URL: j.disc.2007.09.054
OpenAlex ID: W2075036370
cites work: On the Structure of Dense Triangle-Free Graphs
cites work: Q3922703
cites work: Q4379734
cites work: The complexity of planar graph choosability
cites work: Q4388209
cites work: Small graphs with chromatic number 5: A computer search
cites work: Sur le coloriage des graphs
cites work: Q4248539
DOI: 10.1016/J.DISC.2007.09.054
description: scientific article; zbMATH DE number 5499811