Split permutation graphs

DOI10.1007/S00373-013-1290-3zbMath1294.05132OpenAlexW2017003650MaRDI QIDQ2014716

Colin Mayhill, Vadim V. Lozin, Nicholas Korpelainen

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

split graphspermutation graphsclique-widthwell-quasi-order

Mathematics Subject Classification ID

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

Related Items (7)

Labelled well-quasi-order for permutation classes ⋮ The VC-dimension of graphs with respect to \(k\)-connected subgraphs ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ A class of graphs with large rankwidth ⋮ Bichain graphs: geometric model and universal graphs ⋮ The Dilworth number of auto-chordal bipartite graphs ⋮ A counterexample regarding labelled well-quasi-ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well-quasi-order of relabel functions
• Canonical antichains of unit interval and bipartite permutation graphs
• Minimal classes of graphs of unbounded clique-width
• Graph minors. XX: Wagner's conjecture
• Recent developments on graphs of bounded clique-width
• On canonical antichains
• Split graphs of Dilworth number 2
• Letter graphs and well-quasi-order by induced subgraphs
• Clique-width of countable graphs: A compactness property.
• Handle-rewriting hypergraph grammars
• Subgraphs and well‐quasi‐ordering
• ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P₄'S
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Induced subgraphs and well‐quasi‐ordering

This page was built for publication: Split permutation graphs