On characterizing radio \(k\)-coloring problem by path covering problem (Q488288): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6390357 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
radio \(k\)-coloring | |||
Property / zbMATH Keywords: radio \(k\)-coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hamiltonian path | |||
Property / zbMATH Keywords: Hamiltonian path / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
path covering number | |||
Property / zbMATH Keywords: path covering number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
circulant graph | |||
Property / zbMATH Keywords: circulant graph / rank | |||
Normal rank |
Revision as of 21:05, 30 June 2023
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