718 search results - page 20 / 144 » Coloring quasi-line graphs |
ESA
2004
Springer
15 years 2 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
92
Voted
DAM
2008
14 years 9 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...
87
Voted
FSTTCS
2007
Springer
15 years 3 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
15 years 11 months ago
1999
IEEE
101
Voted
CORR
2010
Springer
14 years 9 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...