science

Strong coloring

Strong coloring is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Strong coloring rather than just read about it. In short: 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 part. A graph is strongly k-colorable if, for each partition of the vertices into sets of size k, it admits a strong coloring.

Key takeaways

Strong coloring belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Strong coloring to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Strong coloring from memory before moving on to harder problems.

Reference excerpt

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 part. A graph is strongly k-colorable if, for each partition of the vertices into sets of size k, it admits a strong coloring. 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. 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. Asymptotically, sχ(G) ≤ 11 Δ(G) / 4 + o(Δ(G)). Here, Δ(G) is the maximum degree. Strong chromatic number was independently introduced by Alon (1988) and Fellows (1990).

Related problems Given a graph and a partition of the vertices, an independent transversal is a set U of non-adjacent vertices such that each part contains exactly one vertex of U. A strong coloring is equivalent to a partition of the vertices into disjoint independent-transversals (each independent-transversal is a single "color"). This is in contrast to graph coloring, which is a partition of the vertices of a graph into a given number of independent sets, without the requirement that these independent sets be transversals. To illustrate the difference between these concepts, consider a faculty with several departments, where the dean wants to construct a committee of faculty members. But some faculty members are in conflict and will not sit in the same committee. If the "conflict" relations are represented by the edges of a graph, then:

An independent set is a committee with no conflict. An independent transversal is a committee with no conflict, with exactly one member from each department. A graph coloring is a partitioning of the faculty members into committees with no conflict. A strong coloring is a partitioning of the faculty members into committees with no conflict and with exactly one member from each department. Thus this problem is sometimes called the happy dean problem.

References

Illustrations

Worked examples

Example 1 — a first encounter with Strong coloring

Start with the simplest possible case. Write down what Strong coloring claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Strong coloring before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Strong coloring ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Strong coloring

In research: Strong coloring appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Strong coloring in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Strong coloring is common in secondary-school and first-year university syllabi. It links to neighbouring topics Graph coloring, so understanding it makes those chapters shorter.
In everyday life: Look for Strong coloring outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Strong coloring in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Strong coloring means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Strong coloring out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Strong coloring in simple terms?

Why does Strong coloring matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Strong coloring?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Strong coloring.