On chordal proper circular arc graphs (Q1322203)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On chordal proper circular arc graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On chordal proper circular arc graphs |
scientific article |
Statements
On chordal proper circular arc graphs (English)
0 references
5 May 1994
0 references
A graph is an interval (circular arc) graph if it is the intersection graph of a family of intervals (arcs) on the real line (a circle). An interval (circular arc) graph is proper if the family of intervals (arcs) can be chosen to be inclusion-free. In the paper it is shown that a chordal graph is a proper interval graph if and only if it is claw-free, net-free and not a multiple of the tent. This result implies that a chordal graph is a proper circular arc graph if and only if it is claw-free and net-free.
0 references
claw-free graph
0 references
chordal graph
0 references
proper interval graph
0 references
proper circular arc graph
0 references
