Coloring perfect graphs with no balanced skew-partitions
Discrete Mathematics
2020-12-01 v1
Abstract
We present an algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present time algorithm that colors them.
Keywords
Cite
@article{arxiv.1308.6444,
title = {Coloring perfect graphs with no balanced skew-partitions},
author = {Maria Chudnovsky and Nicolas Trotignon and Théophile Trunck and Kristina Vuskovic},
journal= {arXiv preprint arXiv:1308.6444},
year = {2020}
}