Explore >> Select a destination


You are here

othmarstrombone.wordpress.com
| | dominiczypen.wordpress.com
7.0 parsecs away

Travel
| | Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$...
| | gregashman.wordpress.com
2.8 parsecs away

Travel
| | Reblogged on WordPress.com
| | heathfieldteachshare.wordpress.com
2.2 parsecs away

Travel
| | Reblogged on WordPress.com
| | rapuran.wordpress.com
21.5 parsecs away

Travel
| More on Weekly Travel Theme