Split permutation graphs
From MaRDI portal
Publication:2014716
DOI10.1007/S00373-013-1290-3zbMATH Open1294.05132OpenAlexW2017003650MaRDI QIDQ2014716FDOQ2014716
Colin Mayhill, Vadim 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cites Work
- Graph minors. XX: Wagner's conjecture
- Handle-rewriting hypergraph grammars
- Subgraphs and well‐quasi‐ordering
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Minimal classes of graphs of unbounded clique-width
- Recent developments on graphs of bounded clique-width
- Induced subgraphs and well‐quasi‐ordering
- Title not available (Why is that?)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- Clique-width of countable graphs: A compactness property.
- Split graphs of Dilworth number 2
- Letter graphs and well-quasi-order by induced subgraphs
- Well-quasi-order of relabel functions
- On canonical antichains
- Canonical antichains of unit interval and bipartite permutation graphs
Cited In (10)
- Bounding the Clique-Width of H-free Chordal Graphs
- A counterexample regarding labelled well-quasi-ordering
- Labelled well-quasi-order for permutation classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bichain graphs: geometric model and universal graphs
- A class of graphs with large rankwidth
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs
- The splicing of cycle permutation graphs
- The Dilworth number of auto-chordal bipartite 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)
