An improved procedure for colouring graphs of bounded local density

DOI10.19086/AIC.2022.7MaRDI QIDQ6990770zbMATH OpenFDO

Authors Rémi de Joannis de Verclos, Ross J. Kang

Publication date 29 April 2025

Published in Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/AIC.2022.7

zbMATH Keywords

Erdős-Nešetřil conjecturegraph colouringlocal sparsityReed's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(6)

• Strong edge-coloring of graphs with maximum edge weight seven
• On Vizing's problem for triangle-free graphs
• Injective edge colorings of degenerate graphs and the oriented chromatic number
• Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable
• Edge-coloring of 2-degenerate graphs with induced-forest condition
• Packing edge-colorings of subcubic outerplanar graphs

This page was built for publication: An improved procedure for colouring graphs of bounded local density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990770)