Graph coloring
Graph coloring A 3-coloring suits this graph, but fewer colors would result in adjacent ... minimum number of colors for an arbitrary graph is NP-hard. In graph theory, ...
http://en.wikipedia.org/wiki/Graph_coloring - 14k - Cached - Similar pages

Category:Graph coloring
Category:Graph coloring The main article for this category is Graph coloring. Pages in category "Graph coloring" There are 14 pages in ...
http://en.wikipedia.org/wiki/Category:Graph_coloring - 0k - Cached - Similar pages

Talk:Graph coloring
Talk:Graph coloring On Wikipedia, TeX looks very good when ... classification "The problem of finding a minimum coloring of a graph is NP-hard. The corresponding decision problem (is there a coloring which uses at most k colors?) ...
http://en.wikipedia.org/wiki/Talk:Graph_coloring - 3k - Cached - Similar pages

Edge coloring
Edge coloring In graph theory, as with its vertex counterpart, an edge coloring of a graph, when mentioned without any qualification, is always assumed to be a proper coloring of the edges, meaning no two ...
http://en.wikipedia.org/wiki/Edge_coloring - 5k - Cached - Similar pages

Total coloring
Total coloring In graph theory, total coloring is a type of coloring on the vertices and edges of a graph. When used without any qualification, a ...
http://en.wikipedia.org/wiki/Total_coloring - 5k - Cached - Similar pages

List coloring
List coloring In graph theory, a branch of mathematics, list coloring is a type of graph coloring. More precisely, a list coloring is ...
http://en.wikipedia.org/wiki/List_coloring - 3k - Cached - Similar pages

Strong coloring
Strong coloring In graph theory, a strong coloring, with respect to a partition of the ... of equal sizes, is a (proper) vertex coloring in which every color appears exactly once ... every partition. When the order of the graph G is not divisible by k, ...
http://en.wikipedia.org/wiki/Strong_coloring - 2k - Cached - Similar pages

Graph theory
Graph theory A graph diagram of a graph with 6 vertices and 7 edges. In mathematics and computer science, graph theory studies the properties of graphs. Informally, a graph is a set of objects called ...
http://en.wikipedia.org/wiki/Graph_theory - 21k - Cached - Similar pages

Acyclic coloring
Acyclic coloring In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2-chromatic subgraph is ... acyclic chromatic number A(G) of a graph G is the least number of ...
http://en.wikipedia.org/wiki/Acyclic_coloring - 3k - Cached - Similar pages

Fractional coloring
Fractional coloring 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 ...
http://en.wikipedia.org/wiki/Fractional_coloring - 2k - Cached - Similar pages