134 search results - page 23 / 27 » Induced Subgraphs of Bounded Degree and Bounded Treewidth |
132
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
170
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
144
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
146
Voted
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
104
Voted
ESA
2006
Springer
15 years 5 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...