19 search results - page 1 / 4 » Randomly coloring graphs of girth at least five |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
GC
2002
Springer
13 years 4 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
JGT
2006
13 years 4 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
EJC
2008
13 years 5 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
ALGORITHMICA
2002
13 years 4 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...