4865 search results - page 250 / 973 » The Complexity of Graph Connectivity |
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
157
click to vote
JGT
2006
15 years 6 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
137
click to vote
JGT
2006
15 years 6 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
151
click to vote
GC
2010
Springer
15 years 4 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
175
click to vote
EJC
2011
15 years 1 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...