3008 search results - page 166 / 602 » Independence in connected graphs |
166
click to vote
WAW
2004
Springer
15 years 12 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
212
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
160
click to vote
TVCG
2008
15 years 6 months ago
2008
This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be sh...
143
click to vote
TCOM
2011
15 years 1 months ago
2011
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
154
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...