26 search results - page 6 / 6 » Parameterized Complexity of Finding Regular Induced Subgraph... |
ESA
2006
Springer
13 years 8 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...