Highly Influenced

# K5 is the only double-critical 5-chromatic graph

@article{Stiebitz1987K5IT, title={K5 is the only double-critical 5-chromatic graph}, author={Michael Stiebitz}, journal={Discrete Mathematics}, year={1987}, volume={64}, pages={91-93} }

- Published in Discrete Mathematics 1987
DOI:10.1016/0012-365X(87)90242-1

All graphs considered in this paper are finite, undirected and have neither loops nor multiple edges. Concepts and notation not defined in the paper will be used as in [3]. The set of vertices and the set of edges of a graph G are denoted by V(G) and E(G), respectively. An edge of G consists of an unordered pair of distinct vertices of G. For x e V(G), N(x" G) denotes the set of all vertices of G which are adjacent to x. Further, for e = {x,y} e E(G) put T ( e ' G ) = N ( x ' G ) N N(y:G). If Gâ€¦Â CONTINUE READING