Partitioning chordal graphs into independent sets and cliques (Q1827861)
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 2083790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning chordal graphs into independent sets and cliques |
scientific article; zbMATH DE number 2083790 |
Statements
Partitioning chordal graphs into independent sets and cliques (English)
0 references
6 August 2004
0 references
Chordal graphs
0 references
Split graphs
0 references
Min-max theorems
0 references
Greedy algorithms
0 references
Pre-colouring extension
0 references
List partitions
0 references
0.9441168904304504
0 references
0.9335957765579224
0 references
0.8414453864097595
0 references
0.8175502419471741
0 references
0.7988159656524658
0 references
