Sciweavers

ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 3 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
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...
Robert Berke, Tibor Szabó