65 search results - page 4 / 13 » A decomposition for total-coloring graphs of maximum degree ... |
WG
2001
Springer
14 years 29 days ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
JCT
2006
13 years 8 months ago
2006
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
GD
1998
Springer
14 years 23 days ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
SPAA
2000
ACM
14 years 27 days ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
ENDM
2007
13 years 8 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3