715 search results - page 2 / 143 » On graphs with subgraphs having large independence numbers |
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
COMBINATORICS
2006
13 years 7 months ago
2006
CCCG
2009
13 years 8 months ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...