Seidel Minor, Permutation Graphs and Combinatorial Properties

DOI10.1007/978-3-642-17517-6_19zbMath1311.05169OpenAlexW1561120373MaRDI QIDQ3060733

Vincent Limouzy

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_19

zbMATH Keywords

modular decompositionpermutation graphSeidel complementation

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Permutation graphs and the weak Bruhat order ⋮ Algorithmic aspects of switch cographs ⋮ On graphs associated to sets of rankings ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Computing maximum independent set on outerstring graphs and their relatives

This page was built for publication: Seidel Minor, Permutation Graphs and Combinatorial Properties