Andere Kunden interessierten sich auch für
![Weak Topology (polar topology)]( "Weak Topology (polar topology)")
Weak Topology (polar topology)19,99 €![Total Coloring]( "Total Coloring")
Total Coloring22,99 €![Weak N-category]( "Weak N-category")
Weak N-category22,99 €![Weak Operator Topology]( "Weak Operator Topology")
Weak Operator Topology22,99 €![Road Coloring Problem]( "Road Coloring Problem")
Road Coloring Problem22,99 €![Weak Interpretability]( "Weak Interpretability")
Weak Interpretability25,99 €![Weak Convergence (Hilbert space)]( "Weak Convergence (Hilbert space)")
Weak Convergence (Hilbert space)22,99 €
High Quality Content by WIKIPEDIA articles! A graph vertex coloring is a weak coloring, but not necessarily vice versa. Every graph has a weak 2-coloring. The figure on the right illustrates a simple algorithm for constructing a weak 2-coloring in an arbitrary graph. Part (a) shows the original graph. Part (b) shows a breadth-first search tree of the same graph. Part (c) shows how to color the tree: starting from the root, the layers of the tree are colored alternatingly with colors 1 (dark) and 2 (light). If there is no isolated vertex in the graph G, then a weak 2-coloring determines a domatic partition: the set of the nodes with c(v) = 1 is a dominating set, and the set of the nodes with c(v) = 2 is another dominating set.