On minimal triangle‐free 6‐chromatic graphs

DOI10.1002/jgt.22467zbMath1495.05094arXiv1707.07581OpenAlexW2962872527WikidataQ127448975 ScholiaQ127448975MaRDI QIDQ5110643

Jan Goedgebeur

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.07581

zbMATH Keywords

chromatic numberReed's conjectureexhaustive generationFolkman numbermaximal triangle-free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Questions on color-critical subgraphs ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ 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

This page was built for publication: On minimal triangle‐free 6‐chromatic graphs