134 search results - page 4 / 27 » Induced Subgraphs of Bounded Degree and Bounded Treewidth |
BMCBI
2006
13 years 5 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
WEA
2005
Springer
13 years 11 months ago
2005
Springer
EJC
2010
13 years 5 months ago
2010
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...
JDA
2010
13 years 11 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
WG
2001
Springer
13 years 10 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...