Seidel minor, permutation graphs and combinatorial properties

DOI10.1007/978-3-642-17517-6_19MaRDI QIDQ3060733zbMATH OpenOpenAlexFDO

Authors 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) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 4066932
• A theorem on permutation graphs with applications
• Two characterisations of the minimal triangulations of permutation graphs
• scientific article; zbMATH DE number 622475
• On combination and permutation graphs

Cited in

(6)

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

This page was built for publication: Seidel minor, permutation graphs and combinatorial properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060733)