Category:Graph coloring

From Wikipedia, the free encyclopedia

Jump to: navigation, search

The main article for this category is Graph coloring.

Wikimedia Commons has media related to: Graph coloring

Subcategories

This category has only the following subcategory.

P

• ► Perfect graphs‎ (16 P)

Pages in category "Graph coloring"

The following 46 pages are in this category, out of 46 total. This list may not reflect recent changes (learn more).

1 1-factorization A Acyclic coloring Albertson conjecture B Brooks' theorem C Chromatic polynomial Circular coloring Cocoloring Col (game) Complete coloring Critical graph D De Bruijn–Erdős theorem (graph theory) Defective coloring Dinitz conjecture E Edge coloring Equitable coloring Erdős–Faber–Lovász conjecture

E cont. Exact coloring F Five color theorem Four color theorem Fractional coloring G Graph coloring Greedy coloring Grötzsch's theorem H Hadwiger conjecture (graph theory) Hadwiger–Nelson problem Hajós construction Harmonious coloring Heawood conjecture Heawood number Hedetniemi's conjecture I Interval chromatic number of an ordered graph K Kempe chain

L List coloring List edge-coloring M Multi-trials technique O Oriented coloring P Path coloring R Road coloring problem S Snark (graph theory) Star coloring Strong coloring Subcoloring T Thue number Total coloring U Uniquely colorable graph W Weak coloring

Retrieved from "http://en.wikipedia.org/w/index.php?title=Category:Graph_coloring&oldid=388391420"

Categories:

• Graph theory

• This page was last modified on 3 October 2010 at 02:20.
  
• Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of use for details.
  Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
  
• Contact us

• Privacy policy
• About Wikipedia
• Disclaimers
• Mobile view