Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
From MaRDI portal
Publication:4934785
DOI10.1017/S0963548399004022zbMath0951.05036MaRDI QIDQ4934785
Jaroslav Nešetřil, Alexandr V. Kostochka
Publication date: 30 January 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (7)
Coloring, sparseness and girth ⋮ Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable ⋮ Girth and λ $\lambda $‐choosability of graphs ⋮ Adding Edges to Increase the Chromatic Number of a Graph ⋮ Box and Segment Intersection Graphs with Large Girth and Chromatic Number ⋮ On a construction of graphs with high chromatic capacity and large girth ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges
This page was built for publication: Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
