The Overfull Conjecture on Split-Comparability Graphs
classification
🧮 math.CO
keywords
split-comparabilityconjecturegraphsoverfullchromaticclassdeltaequal
read the original abstract
We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.