Slender graphs (Q1096653)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Slender graphs |
scientific article |
Statements
Slender graphs (English)
0 references
1989
0 references
We consider the graphs that can be obtained by deleting in an i- triangulated graph G all the edges of an arbitrary matching M in G. These graphs will be called slender graphs and we prove that they are perfect.
0 references
triangulated graph
0 references
arbitrary matching
0 references
slender graphs
0 references
edge deletion
0 references
