Split permutation graphs

DOI10.1007/S00373-013-1290-3MaRDI QIDQ2014716zbMATH OpenOpenAlexFDO

Authors Nicholas Korpelainen, Vadim Lozin, Colin Mayhill

Publication date 16 June 2014

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-013-1290-3

zbMATH Keywords

clique-widthpermutation graphssplit graphswell-quasi-order

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 622475
• Split-neighbourhood graphs and the strong perfect graph conjecture
• scientific article; zbMATH DE number 3970804
• Threshold dimension of split-permutation graphs
• scientific article; zbMATH DE number 2191997

Cites work

• Canonical antichains of unit interval and bipartite permutation graphs
• Clique-width of countable graphs: A compactness property.
• Graph minors. XX: Wagner's conjecture
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 2191997 (Why is no real title available?)
• Induced subgraphs and well‐quasi‐ordering
• Letter graphs and well-quasi-order by induced subgraphs
• Minimal classes of graphs of unbounded clique-width
• On canonical antichains
• On the clique-width of graph with few \(P_{4}\)'s
• On the clique-width of some perfect graph classes
• Recent developments on graphs of bounded clique-width
• Split graphs of Dilworth number 2
• Subgraphs and well‐quasi‐ordering
• Well-quasi-order of relabel functions

Cited in

(14)

• The splicing of cycle permutation graphs
• A counterexample regarding labelled well-quasi-ordering
• Bounding the clique-width of H-free chordal graphs
• Threshold dimension of split-permutation graphs
• The VC-dimension of graphs with respect to k-connected subgraphs
• scientific article; zbMATH DE number 3898942 (Why is no real title available?)
• scientific article; zbMATH DE number 3970804 (Why is no real title available?)
• scientific article; zbMATH DE number 622475 (Why is no real title available?)
• The Dilworth number of auto-chordal bipartite graphs
• Labelled well-quasi-order for permutation classes
• A class of graphs with large rankwidth
• Critical properties of bipartite permutation graphs
• Comparing width parameters on graph classes
• Bichain graphs: geometric model and universal graphs

This page was built for publication: Split permutation graphs

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