An Investigation of Colour-Critical Graphs with Complements of Low Connectivity

摘要: Publisher Summary This chapter investigates color-critical graphs with complements of low connectivity. A k -chromatic graph Γ is called v -critical if all vertices x the are critical. It e it connected and edges follows from these definitions that an also -critical. The critical 3-chromatic odd circuits. seems hopeless to try determine structure chromatic number 4 or more. complement a ( -critical) only each component graph. result gives method for constructing new known ones.