Linear time recognition of P4-indifference graphs
Résumé
A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has a
Origine : Fichiers produits par l'(les) auteur(s)
Loading...