100 search results - page 10 / 20 » Coloring powers of planar graphs |
COCOON
2003
Springer
14 years 27 days ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
DM
1998
13 years 7 months ago
1998
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
CAE
2007
13 years 10 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...