A generalized construction of chromatic index critical graphs from bipartite graphs
Michael J. Plantholt · Journal of Graph Theory · 1985
Abstract We prove that any graph with maximum degree n which can be obtained by removing exactly 2n ‐ 1 edges from the join K1 + Kn, n is n‐critical. This generalizes special constructions of critical graphs by S. Fiorini and H. P. Yap, and suggests a possible extension of another general construction due to Yap.