45 search results - page 4 / 9 » Connectedness of the graph of vertex-colourings |
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
DM
2006
13 years 7 months ago
2006
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
STACS
2010
Springer
14 years 2 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...
DCG
2011
13 years 2 months ago
2011
We examine the generic local and global rigidity of various graphs in Rd . Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d + 1)-connected...
WSTST
2005
Springer
14 years 26 days ago
2005
Springer
