16 search results - page 4 / 4 » Laplacian spectral bounds for clique and independence number... |
SIAMDM
2008
13 years 5 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...