|
You are here |
www.guyrutenberg.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$... | |
| | | | |
cambridge163.wordpress.com
|
|
| | | | | This is the excerpt for your very firstpost. | |
| | | | |
baselinescenario.com
|
|
| | | | | What happened to the global economy and what we can do about it | |
| | | | |
caitlinsanswersforhumanitiesclass.wordpress.com
|
|
| | | This is the excerpt for your very first post. | ||