Monadic second-order definable graph orderings
Résumé
We examine combinatorial consitions of a graph class making it possible to define a linear order of each of its graphs by monadic second-order formulas, with or without edge quantifications. Our results concern graph classes excluding a minor and particular classes of cographs and chordal graphs.
Origine : Fichiers produits par l'(les) auteur(s)