Share
Explore BrainMass

Chromatic Numbers and Graph Coloring

Let G1 be a graph such that every two odd cycles intersect. Prove that X(G)=<5.

(The minimum integer for which a graph is k-colorable is called the vertex chromatic number, or simply the chromatic number of , and is denote by , this problem is about graph coloring).

Attachments

Solution Summary

Chromatic Numbers and Graph Coloring are investigated.

$2.19