Chromatic-index critical multigraphs of order 20

Abstract

A multigraph M with maximum degree (M) is called critical, if the chromatic index 0 (M) > (M) and 0 (M ? e) = 0 (M) ? 1 for each edge e of M. The weak critical graph conjecture 1, 7] claims that there exists a constant c > 0 such that every critical multigraph M with at most c (M) vertices has odd order. We disprove this conjecture by constructing critical… (More)
DOI: 10.1002/(SICI)1097-0118(200004)33:4%3C240::AID-JGT5%3E3.0.CO;2-R

Topics

  • Presentations referencing similar topics