3008 search results - page 79 / 602 » Independence in connected graphs |
91
Voted
DAM
2002
15 years 19 days ago
2002
The coupled graph c(G) of a plane graph G is the graph de
107
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
43
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
127
Voted
COMBINATORICS
1999
15 years 15 days ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
93
Voted
JCT
2011
14 years 7 months ago
2011
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associah...