Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces

DOI10.1023/A:1019808819476zbMath1021.05036OpenAlexW2130130375MaRDI QIDQ1810157

Oleg V. Borodin, Eric Sopena, Andre Raspaud, Alexandr V. Kostochka

Publication date: 15 June 2003

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019808819476

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces