762 search results - page 13 / 153 » Strategic Coloring of a Graph |
148
click to vote
JGT
2007
15 years 6 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
195
click to vote
OL
2010
15 years 1 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
162
Voted
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
187
click to vote
IJAMCIGI
2010
15 years 1 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
155
click to vote
JCT
2008
15 years 6 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...