The Overfull Conjecture on Split-Comparability Graphs
Combinatorics
2017-10-11 v1
Abstract
We show in this paper that a split-comparability graph has chromatic index equal to if and only if is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability graphs.
Cite
@article{arxiv.1710.03524,
title = {The Overfull Conjecture on Split-Comparability Graphs},
author = {Jadder Bismarck de Sousa Cruz and Cândida Nunes da Silva and Sheila Morais de Almeida},
journal= {arXiv preprint arXiv:1710.03524},
year = {2017}
}