- #1
vshiro
does anyone have an idea on proving that there is a triangle-free k-chromatic graph for every positive integer k?
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
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