Sciweavers

751 search results - page 19 / 151
» The Distinguishing Chromatic Number
Sort
View
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 8 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
ALGORITHMICA
2004
150views more  ALGORITHMICA 2004»
13 years 8 months ago
Sum Coloring of Bipartite Graphs with Bounded Degree
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
Michal Malafiejski, Krzysztof Giaro, Robert Jancze...
JGT
2008
97views more  JGT 2008»
13 years 8 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
WG
2004
Springer
14 years 1 months ago
Coloring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
Michaël Rao
ENDM
2007
111views more  ENDM 2007»
13 years 8 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu