715 search results - page 27 / 143 » On graphs with subgraphs having large independence numbers |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
SWAT
2010
Springer
14 years 18 days ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
ISAAC
2004
Springer
14 years 27 days ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
CN
2007
13 years 7 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...