1302 search results - page 53 / 261 » On the Strong Chromatic Number |
123
click to vote
VTC
2010
IEEE
15 years 4 months ago
2010
IEEE
As the number of wireless devices sharing a radio band increases, so does the number N of potential co
152
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
168
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
186
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
138
click to vote
JGT
2008
15 years 6 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 ...