Partitioning graphs into complete and empty graphs (Q1045126)
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: Partitioning graphs into complete and empty graphs |
scientific article; zbMATH DE number 5648158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning graphs into complete and empty graphs |
scientific article; zbMATH DE number 5648158 |
Statements
Partitioning graphs into complete and empty graphs (English)
0 references
15 December 2009
0 references
(\(j,k\))-coloring
0 references
split graph
0 references
cocoloring
0 references
0 references
0 references
0 references
0.9392108
0 references
0.9292728
0 references
0.9292728
0 references
0.92840874
0 references
0.92840874
0 references
