Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
type: Item
instance of: scholarly article
title: Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
zbMATH Open document ID: 1021.05036
DOI: 10.1023/A:1019808819476
author: Oleg V. Borodin
author: Alexandr Kostochka
author: André Raspaud
author: Éric Sopena
published in: Mathematical Notes
publication date: 2003-06-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1928259
MaRDI profile type: Publication
full work available at URL: a:1019808819476
OpenAlex ID: W2130130375
Recommended article: Acyclic \(k\)-strong coloring of maps on surfaces
Recommended article: On acyclic colorings of graphs on surfaces
Recommended article: The number of \(k\)-colorings of a graph on a fixed surface
Recommended article: k-Chromatic Number of Graphs on Surfaces
Recommended article: On the Total Coloring of Graphs Embeddable in Surfaces
Recommended article: The number of defective colorings of graphs on surfaces
Recommended article: Q3139747
Recommended article: Strong k-colourings of graphs
Recommended article: Coloring parameters for graphs on surfaces
Recommended article: Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
description: scientific article; zbMATH DE number 1928259