Perfect graph decompositions (Q1175555)
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: Perfect graph decompositions |
scientific article; zbMATH DE number 11889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect graph decompositions |
scientific article; zbMATH DE number 11889 |
Statements
Perfect graph decompositions (English)
0 references
25 June 1992
0 references
Proved are three theorems presenting upper and lower bounds of the minimum number of perfect subgraphs covering or partitioning either the vertex set or the edge set of a given graph. The weighted versions of both cases are studied, too. All the theorems are based on four lemmas, one of which being proved and published by the author in 1986.
0 references
decompositions
0 references
bound
0 references
weight
0 references
bounds
0 references
covering
0 references
partitioning
0 references
0 references
0 references
0.94268364
0 references
0.9340222
0 references
0 references
0.9241796
0 references
