836 search results - page 29 / 168 » Orthogonal Colorings of Graphs |
101
click to vote
DAM
2008
14 years 11 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
101
click to vote
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
ICIP
1999
IEEE
16 years 1 months ago
1999
IEEE
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...