On characterizing radio \(k\)-coloring problem by path covering problem (Q488288): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.11.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034268496 / rank | |||
Normal rank | |||
Revision as of 20:17, 19 March 2024
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
