Strong coloring

Strong coloring

[

This cubic graph is strongly 4-colorable. The 4-sized partitions are 35, but only this 7 partitions are topologically unique.]

In graph theory, a strong coloring, with respect to a partition of the vertices into (disjoint) subsets of equal sizes, is a (proper) vertex coloring in which every color appears exactly once in every partition.When the order of the graph "G" is not divisible by "k", we add isolated vertices to "G" just enough to make the order of the new graph "G′" divisible by "k".In that case, a strong coloring of "G′" minus the previously added isolated vertices is considered a strong coloring of "G".A graph is strongly "k"-colorable if, for each partition of the vertices into sets of size "k", it admits a strong coloring.

The strong chromatic number sχ("G") of a graph "G" is the least "k" such that "G" is strongly "k"-colorable.A graph is strongly "k"-chromatic if it has strong chromatic number "k".

Some properties of sχ("G"):
# sχ("G") > Δ("G").
# sχ("G") ≤ 3 Δ("G") − 1 (Haxell)
# Asymptotically, sχ("G") ≤ 11 Δ("G") / 4 + o(Δ("G")). (Haxell)Here Δ("G") is the maximum degree.

Strong chromatic number was independently introduced by Alon (1988) and Fellows (1990).

References

* Alon, Noga (1988). The linear arboricity of a graph. "Israel J. Math." 62, 311–325.
* Alon, Noga (1992). The strong chromatic number. "Random Structures and Algorithms" 3, 1–7.
* Fellows, Michael R. (1990). Transversals of vertex partition in graphs. "SIAM J. Discrete Math." 3, 206–215.
* Jensen, Tommy R.; Toft, Bjarne (1995). "Graph coloring problems". New York: Wiley-Interscience. ISBN 0-471-02865-7.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Strong — may refer to:General usage*Strong acid *Strong agnosticism *Strong AI *Strong atheism *Strong cardinal *Strong coloring *Strong convergence *Strong CP problem *Strong cryptography *Strong inflection (linguistics):*Germanic strong verb *Strong… …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Fractional coloring — A 4:2 coloring ofthis graph does not exist.] Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory.It differs from the traditional graph coloring in the sense that it assigns sets of colors instead of… …   Wikipedia

  • Map coloring — is the act of assigning different colors to different features on a map. There are two very different uses of this term. The first is in cartography, choosing the colors to be used when producing a map. The second is in mathematics, where the… …   Wikipedia

  • East Germanic strong verb — See also the articles West Germanic strong verb and Germanic verb. Indo EuropeanThe Indo European vowel alternations could be as follows:* ei mdash; oi mdash; i * eu mdash; ou mdash; u * e mdash; o mdash; nullThese are all the same, being an… …   Wikipedia

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Il Sodoma — (1477 ndash; February 14, 1549?) was the name given to the Italian Mannerist painter Giovanni Antonio Bazzi [Also wrongly spelled Razzi. The artist s real surname is uncertain. He is said to have borne the family name of Sodona but also the name… …   Wikipedia

  • Coptis chinensis — Chinese goldthread Scientific classification Kingdom: Plantae Division: Magnoliophyta Class: Magno …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”