762 search results - page 5 / 153 » Strategic Coloring of a Graph |
JCT
2008
14 years 9 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides s...
DM
2010
14 years 9 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
COLOGNETWENTE
2009
14 years 10 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...