Split graphs of Dilworth number 2

DOI10.1016/0012-365X(85)90040-8zbMath0573.05047MaRDI QIDQ1063046

C. Benzaken, Dominique de Werra, Peter L. Hammer

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

split graphsinterval graphsthreshold graphDilworth number

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (14)

On pairwise compatibility graphs having Dilworth number two ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ Bichain graphs: geometric model and universal graphs ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Path-bicolorable graphs ⋮ The Dilworth number of auto-chordal bipartite graphs ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Recognition of split-graphic sequences ⋮ Split permutation graphs ⋮ On split-coloring problems ⋮ Path-Bicolorable Graphs ⋮ Interval graphs and related topics ⋮ UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold characterization of graphs with dilworth number two
• Split Graphs Having Dilworth Number Two
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Split graphs of Dilworth number 2