Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
type: Item
instance of: scholarly article
title: Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
zbMATH Open document ID: 1327.05103
author: Sylvain Gravier
author: Hebert Coelho
author: Luerbio Faria
author: Sulamita Klein
published in: Discrete Applied Mathematics
publication date: 2015-12-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6516926
zbMATH Keywords: oriented coloring
zbMATH Keywords: maximum degree 3 graph
zbMATH Keywords: planar graph
zbMATH Keywords: bipartite graph
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: j.dam.2015.06.023
OpenAlex ID: W2173582843
cites work: The Complexity of Colouring by Semicomplete Digraphs
cites work: Partition into cliques for cubic graphs: Planar case, complexity and approximation
cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
cites work: Homomorphisms and oriented colorings of equivalence classes of oriented graphs
cites work: Good and semi-strong colorings of oriented planar graphs
cites work: Complexity of two coloring problems in cubic planar bipartite mixed graphs
cites work: On two coloring problems in mixed graphs
cites work: The chromatic number of oriented graphs
cites work: Oriented graph coloring
cites work: Node-and edge-deletion NP-complete problems
DOI: 10.1016/J.DAM.2015.06.023
description: scientific article; zbMATH DE number 6516926