Coloring square-free Berge graphs
Résumé
We consider the class of Berge graphs that do not contain a chordless cycle of length 4. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class.
Origine : Fichiers produits par l'(les) auteur(s)