Weakly triangulated graphs (Q801088)
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 3877233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly triangulated graphs |
scientific article; zbMATH DE number 3877233 |
Statements
Weakly triangulated graphs (English)
0 references
1985
0 references
A graph is triangulated if it has no chordless cycle with four or more vertices. It follows that the complement of a triangulated graph cannot contain a chordless cycle with five or more vertices. We introduce a class of graphs (namely weakly triangulated graphs) which includes both triangulated graphs and complements of triangulated graphs (we define a graph as weakly triangulated if neither it nor its complement contains a chordless cycle with five or more vertices). Our main result is a structural theorem which leads to a proof that weakly triangulated graphs are perfect.
0 references
perfect graphs
0 references
chordless cycle
0 references
triangulated graph
0 references
0.8901417851448059
0 references
0.8668083548545837
0 references
0.8311594128608704
0 references
0.8220892548561096
0 references
0.8150559663772583
0 references
