9 search results - page 1 / 2 » Coloring squares of planar graphs with girth six |
EJC
2008
14 years 10 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. ...
GC
2002
Springer
14 years 10 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
JGT
2008
14 years 10 months ago
2008
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
82
Voted
JGT
2006
14 years 10 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...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...