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}
}
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
BETA

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Some remarks on Hadwiger's conjecture and its relation to a conjecture of Lov~sz

  • U Krusenstjerna-Hofstr¢m, B. Tort
  • in: G. Chatrand, ed., The Theory of Applications…
  • 1981
1 Excerpt

Combinatorial Problems and Exercises (Akad

  • L. Lovisz
  • Kiad6, Budapest,
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…