does anyone have an idea on proving that there is a triangle-free k-chromatic graph for every positive integer k?(adsbygoogle = window.adsbygoogle || []).push({});

or, how to prove that given a simplicial ordering on a chordal graph G, running the greedy coloring algorithm on the reverse order gives the optimal coloring on the complement graph?

one might think to use induction but it's all very messy and ecchhh

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# More graph theory

**Physics Forums | Science Articles, Homework Help, Discussion**