3008 search results - page 26 / 602 » Independence in connected graphs |
150
click to vote
LMCS
2006
15 years 6 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
149
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
187
click to vote
LATIN
2010
Springer
16 years 25 days ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
125
click to vote
FOCS
2007
IEEE
16 years 10 days ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
161
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...