On the radio k-chromatic number of some classes of trees

DOI10.1007/S40819-020-0778-9MaRDI QIDQ2657544zbMATH OpenOpenAlexFDO

Authors P. K. Niranjan, Srinivasa Rao Kola

Publication date 13 March 2021

Published in International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40819-020-0778-9

zbMATH Keywords

radio numberradio \(k\)-chromatic numberradio \(k\)-coloringradio coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 7725444
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Radio k-colorings of paths
• A lower bound for radio \(k\)-chromatic number
• Radio numbers of certain \(m\)-distant trees

Cites work

• A lower bound technique for radio k-coloring
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Optimal radio labellings of complete m-ary trees
• Radio labelings of graphs
• Radio number for trees
• Radio number of trees
• Radio number of trees
• Radio numbers of certain \(m\)-distant trees
• Radio numbers of some caterpillars
• Upper bounds on the radio number of some trees

Cited in

(7)

• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio and radial radio numbers of certain sunflower extended graphs
• Radio numbers of certain \(m\)-distant trees
• Optimal radiocoloring of trees
• scientific article; zbMATH DE number 7725444 (Why is no real title available?)
• A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters
• Radio \(k\)-chromatic number of full \(m\)-ary trees

This page was built for publication: On the radio \(k\)-chromatic number of some classes of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657544)