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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On characterizing radio \(k\)-coloring problem by path covering problem |
scientific article |
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
