Sciweavers

Share
139 search results - page 1 / 28
» Induced Subgraphs of Bounded Degree and Bounded Treewidth
Sort
View
WG
2005
Springer
10 years 3 months ago
Induced Subgraphs of Bounded Degree and Bounded Treewidth
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 ...
Prosenjit Bose, Vida Dujmovic, David R. Wood
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
10 years 10 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
9 years 11 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ENDM
2008
93views more  ENDM 2008»
9 years 10 months ago
On Universal Graphs of Minor Closed Families
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
Arnaud Labourel
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
10 years 4 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
books