Small graphs with chromatic number 5: A computer search
From MaRDI portal
Publication:4320470
DOI10.1002/jgt.3190190111zbMath0821.05023OpenAlexW2155934997MaRDI QIDQ4320470
Gordon F. Royle, Tommy R. Jensen
Publication date: 1 February 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190190111
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
Note on a conjecture of Toft ⋮ Small minimal $(3, 3)$-Ramsey graphs ⋮ Questions on color-critical subgraphs ⋮ Unnamed Item ⋮ Remarks on a conjecture of Barát and Tóth ⋮ The smallest 5-chromatic tournament ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ On some generalized vertex Folkman numbers ⋮ Chromatic vertex Folkman numbers ⋮ Integer sequence discovery from small graphs ⋮ On degree sums of a triangle-free graph ⋮ Gallai's problem on Dirac's construction ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ (\(\Delta-k\))-critical graphs ⋮ The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) ⋮ Partitioning graphs into complete and empty graphs ⋮ The size of a minimum five-chromatic \(K_ 4\)-free graph
Cites Work
