762 search results - page 70 / 153 » Strategic Coloring of a Graph |
175
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
131
click to vote
JGT
2010
15 years 3 months ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
153
click to vote
JGAA
2000
15 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
134
click to vote
ENDM
2007
15 years 4 months ago
2007
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...
130
click to vote
RSA
2011
14 years 11 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...