Sciweavers

3 search results - page 1 / 1
» Relaxed two-coloring of cubic graphs
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 8 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ó
JCT
2007
62views more  JCT 2007»
13 years 4 months ago
Relaxed two-coloring of cubic graphs
Robert Berke, Tibor Szabó
DM
2011
202views Education» more  DM 2011»
12 years 8 months ago
Two-ended regular median graphs
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
Wilfried Imrich, Sandi Klavzar