Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,317,438 papers from all fields of science
Search
Sign In
Create Free Account
Oriented coloring
In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it isan assignment of colors to vertices of an oriented graph…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Acyclic coloring
Complete coloring
Degree (graph theory)
Graph embedding
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Oriented coloring on recursively defined digraphs
Frank Gurski
,
Dominique Komander
,
Carolin Rehs
Algorithms
2019
Corpus ID: 91183957
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied…
Expand
2019
2019
Oriented coloring of graphs with low maximum degree
P. Ochem
,
Alexandre Pinlou
arXiv.org
2019
Corpus ID: 168169574
Duffy et al. [C. Duffy, G. MacGillivray, and E. Sopena, Oriented colourings of graphs with maximum degree three and four…
Expand
2019
2019
D S ] 2 A pr 2 01 9 Oriented coloring on recursively defined digraphs
Frank Gurski
,
Dominique Komander
,
Carolin Rehs
2019
Corpus ID: 102513899
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied…
Expand
2014
2014
Oriented coloring is NP-complete on a small class of graphs
G. Guégan
,
P. Ochem
2014
Corpus ID: 14067457
A series of recent papers shows that it is NP-complete to deci de whether an oriented graph admits a homomorphism to the…
Expand
2010
2010
Forbidden subgraph colorings, Oriented colorings and intersection dimensions of graphs[HBNI Th 32]
N. Aravind
2010
Corpus ID: 118590261
This thesis deals mainly with two related coloring problems forbidden subgraph colorings and oriented colorings. The former deals…
Expand
2009
2009
An oriented coloring of planar graphs with girth at least five
Alexandre Pinlou
Discrete Mathematics
2009
Corpus ID: 1586688
2008
2008
Color Mining Based Customer Oriented Coloring Pipeline of Coloring Scheme for Efficient City Design
S. Chin
,
Jinsoo Oh
International Conference on Computer and…
2008
Corpus ID: 15217932
The research conducted in this paper is to present coloring pipeline of coloring scheme for city design. Coloring pipeline…
Expand
Review
2007
Review
2007
Combinatorial algorithms for graphs and partially ordered sets
J. Nilsson
2007
Corpus ID: 266095
In this thesis we study combinatorial and algorithmic problems for graphs and partially ordered sets. The thesis is centered…
Expand
1994
1994
Computing Chromatic Polynomials of Oriented Graphs
É. Sopena
1994
Corpus ID: 5789644
Let G = (V; A) be an antisymmetric directed graph. An oriented-coloring of G is deened as a mapping c from V to the set of colors…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE