100 search results - page 5 / 20 » Coloring powers of planar graphs |
IPL
2010
13 years 6 months ago
2010
TCS
2011
13 years 2 months ago
2011
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
RSA
2008
13 years 7 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
CCCG
2010
13 years 9 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...