You are here |
othmarstrombone.wordpress.com | ||
| | | |
dominiczypen.wordpress.com
|
|
| | | | 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
|
|
| | | | Reblogged on WordPress.com | |
| | | |
heathfieldteachshare.wordpress.com
|
|
| | | | Reblogged on WordPress.com | |
| | | |
rapuran.wordpress.com
|
|
| | More on Weekly Travel Theme |