A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A graph is totally critical if it is Type 2, connected, and the removal of any edge reduces the total chromatic number. A good characterization of all totally critical graphs is unlikely as Sanchez-Arroyo showed that determining the total chromatic number of a graph is an NP-hard problem. In this paper we show that if the Conformability Conjecture is correct, then totally critical graphs of even order with maximum degree at least one half of their order are characterized by a simple equationdoi:10.1006/jctb.1999.1902 fatcat:hk6igpj34bfqzcw27ygjxe6sne