The Overfull Conjecture on Split-Comparability Graphs
Abstract
We show in this paper that a split-comparability graph G has chromatic index equal to (G) + 1 if and only if G is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.