Chromatic-index-critical graphs of even order
Stefan Gr�newald, Eckhard Steffen · Journal of Graph Theory · 1999
A k-critical (multi-) graph G has maximum degree k, chromatic index χ′(G) = k + 1, and χ′(G − e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k-critical (multi-) graphs with certain properties to obtain counterexamples to some well-known conjectures. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 27–36, 1999