Split graphs of Dilworth number 2 (Q1063046): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Peter L. Hammer / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: L'udovít Niepel / rank | |||
Normal rank | |||
Revision as of 09:40, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Split graphs of Dilworth number 2 |
scientific article |
Statements
Split graphs of Dilworth number 2 (English)
0 references
1985
0 references
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.
0 references
threshold graph
0 references
Dilworth number
0 references
split graphs
0 references
interval graphs
0 references
