Good and semi-strong colorings of oriented planar graphs
type: Item
instance of: scholarly article
title: Good and semi-strong colorings of oriented planar graphs
zbMATH Open document ID: 0806.05031
DOI: 10.1016/0020-0190(94)00088-3
published in: Information Processing Letters
publication date: 1994-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 643655
zbMATH Keywords: oriented graph
zbMATH Keywords: planar graph
zbMATH Keywords: good coloring
zbMATH Keywords: semi-strong coloring
author: André Raspaud
author: Éric Sopena
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00088-3
OpenAlex ID: W2154567859
Wikidata QID: Q115927015
cites work: Every planar graph has an acyclic 7-coloring
cites work: On acyclic colorings of planar graphs
cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
cites work: Acyclic colorings of planar graphs
cites work: Parallel concepts in graph theory
cites work: On the complexity of H-coloring
cites work: Q4200238
cites work: Colorings and interpretations: a connection between graphs and grammar forms
cites work: Every planar graph has an acyclic 8-coloring
cites work: Decomposition of Finite Graphs Into Forests
description: scientific article; zbMATH DE number 643655