Split graphs of Dilworth number 2
From MaRDI portal
In this paper is given a short outline of results concerning to graphs with Dilworth number at most 2. There is proved the equivalence of split graphs with Dilworth number at most 2 and the class of graphs G such that G and its complement \(\bar G\) are interval graphs. There is also given a characterisation of such graphs by means of forbidden graphs.
Recommendations
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3613062 (Why is no real title available?)
- Split Graphs Having Dilworth Number Two
- Threshold characterization of graphs with dilworth number two
Cited in
(18)- Interval graphs and related topics
- Representations of graphs and networks (coding, layouts and embeddings)
- A counterexample regarding labelled well-quasi-ordering
- Split permutation graphs
- Recognition of split-graphic sequences
- On pairwise compatibility graphs having Dilworth number two
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Universal graphs and universal permutations
- On class 2 split graphs
- Path-bicolorable graphs. (Extended abstract)
- Threshold characterization of graphs with dilworth number two
- scientific article; zbMATH DE number 4125434 (Why is no real title available?)
- The Dilworth number of auto-chordal bipartite graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Path-bicolorable graphs
- A bound for the Dilworth number
- Bichain graphs: geometric model and universal graphs
- On split-coloring problems
This page was built for publication: Split graphs of Dilworth number 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063046)
