The packing coloring problem for \((q,q-4)\) graphs (Q3167635)
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: The packing coloring problem for (q,q-4) graphs |
scientific article; zbMATH DE number 6101793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The packing coloring problem for \((q,q-4)\) graphs |
scientific article; zbMATH DE number 6101793 |
Statements
The Packing Coloring Problem for (q,q-4) Graphs (English)
0 references
2 November 2012
0 references
packing coloring
0 references
packing chromatic number
0 references
\((q, q-4)\) graphs
0 references
0.8575892448425293
0 references
0.8552405834197998
0 references
0.8448317050933838
0 references
0.8443169593811035
0 references
0.8234171867370605
0 references
