459 search results - page 4 / 92 » Detecting induced subgraphs |
WG
2005
Springer
14 years 24 days ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2008
Springer
13 years 7 months ago
2008
Springer
