A Graph Radio k-Coloring Algorithm

DOI10.1007/978-3-642-35926-2_15zbMath1293.68207OpenAlexW159313573MaRDI QIDQ2876567

Laxman Saha, Pratima Panigrahi

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_15

zbMATH Keywords

channel assignmentspanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A new graph radio k-coloring algorithm ⋮ Antipodal number of full \(m\)-ary trees ⋮ Radio $k$-labeling of paths ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

This page was built for publication: A Graph Radio k-Coloring Algorithm