Bounding \chi by a fraction of \Delta for graphs without large cliques

Marthe Bonamy and Tom Kelly and Peter Nelson and Luke Postle

misc2022

Citation key: BonamyPerrettPostle2020Reed
Year: 2022
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Marthe Bonamy, Tom Kelly, Peter Nelson, and Luke Postle, “Bounding \chi by a fraction of \Delta for graphs without large cliques,” Journal of Combinatorial Theory, Series B 157 (2022), 263–282, DOI: 10.1016/j.jctb.2022.06.002.

Catalog connections

Conjectures citing this source

GRAPH-017Reed's $\Delta$ – $\omega$ Chromatic ConjectureGraph theory

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Marthe Bonamy and Tom Kelly and Peter Nelson and Luke Postle
doi: 10.1016/j.jctb.2022.06.002
note: Marthe Bonamy, Tom Kelly, Peter Nelson, and Luke Postle, “Bounding \chi by a fraction of \Delta for graphs without large cliques,” Journal of Combinatorial Theory, Series B 157 (2022), 263--282, DOI: 10.1016/j.jctb.2022.06.002.
title: Bounding \chi by a fraction of \Delta for graphs without large cliques
year: 2022