Adding Edges to Increase the Chromatic Number of a Graph

DOI10.1017/S0963548316000146zbMath1372.05077OpenAlexW2321820803MaRDI QIDQ5366913

Jaroslav Nešetřil, Alexandr V. Kostochka

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548316000146

Mathematics Subject Classification ID

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

Cites Work

• Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number

This page was built for publication: Adding Edges to Increase the Chromatic Number of a Graph