On \(d\)-diagonal colorings of embedded graphs of low maximum face size
type: Item
instance of: scholarly article
title: On \(d\)-diagonal colorings of embedded graphs of low maximum face size
zbMATH Open document ID: 0905.05029
author: Daniel P. Sanders
author: Yue Zhao
published in: Graphs and Combinatorics
publication date: 1999-02-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1146349
zbMATH Keywords: generalized coloring
zbMATH Keywords: d-diagonal coloring
zbMATH Keywords: cyclic coloring
zbMATH Keywords: diagonal coloring
MaRDI profile type: Publication
full work available at URL: s003730050017
OpenAlex ID: W1993707808
DOI: 10.1007/S003730050017
Recommended article: Face colorings of embedded graphs
Recommended article: Ond-diagonal colorings
Recommended article: Facial incidence colorings of embedded multigraphs
Recommended article: On simultaneous colorings of embedded graphs
Recommended article: Q3201070
Recommended article: A structural theorem on embedded graphs and its application to colorings
Recommended article: On the maximum diameter of \(k\)-colorable graphs
Recommended article: The edge-face coloring of graphs embedded in a surface of characteristic zero
Recommended article: Face 2-colourable triangular embeddings of complete graphs
Recommended article: \(\ell\)-facial edge colorings of graphs
description: scientific article; zbMATH DE number 1146349