Seidel minor, permutation graphs and combinatorial properties
From MaRDI portal
Publication:3060733
Recommendations
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)