On characterizing radio \(k\)-coloring problem by path covering problem (Q488288)
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: On characterizing radio k-coloring problem by path covering problem |
scientific article; zbMATH DE number 6390357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On characterizing radio \(k\)-coloring problem by path covering problem |
scientific article; zbMATH DE number 6390357 |
Statements
On characterizing radio \(k\)-coloring problem by path covering problem (English)
0 references
23 January 2015
0 references
radio \(k\)-coloring
0 references
Hamiltonian path
0 references
path covering number
0 references
circulant graph
0 references
0 references
0.8624677062034607
0 references
0.8380640745162964
0 references
0.8256073594093323
0 references
0.8243255019187927
0 references
