Slightly triangulated graphs are perfect (Q1340126)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 700942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Slightly triangulated graphs are perfect |
scientific article; zbMATH DE number 700942 |
Statements
Slightly triangulated graphs are perfect (English)
0 references
9 February 1995
0 references
A graph \(G\) is said to be slightly triangulated iff \(G\) has the following two properties: (i) \(G\) contains no chordless cycle with at least 5 vertices, and (ii) for every induced subgraph \(H\) of \(G\), there is a vertex in \(H\) the neighbourhood of which in \(H\) contains no chordless path of 4 vertices. The author shows that every slightly triangulated graph is perfect. Comparisons with other classes of perfect graphs and open problems are considered too.
0 references
chordless cycle
0 references
chordless path
0 references
slightly triangulated graph
0 references
perfect graphs
0 references
0.8311594128608704
0 references
0.795106828212738
0 references
0.7900292873382568
0 references
