Split graphs of Dilworth number 2 (Q1063046): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Threshold characterization of graphs with dilworth number two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4165164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4177589 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Split Graphs Having Dilworth Number Two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Latest revision as of 17:41, 14 June 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
