A graph radio k-coloring algorithm

DOI10.1007/978-3-642-35926-2_15MaRDI QIDQ2876567zbMATH OpenOpenAlexFDO

Authors 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 assignmentradio \(k\)-chromatic numberradio \(k\)-coloringspan

Mathematics Subject Classification ID

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

Recommendations

• A new graph radio k-coloring algorithm
• Upper bound for radio k-chromatic number of graphs in connection with partition of vertex set
• A lower bound for radio \(k\)-chromatic number
• A lower bound technique for radio k-coloring
• Radio k-colorings of paths

Cited in

(16)

• Antipodal number of full \(m\)-ary trees
• Antipodal radio labelling of full binary trees
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• On the radio number of toroidal grids
• On radio number of power of cycles
• scientific article; zbMATH DE number 2068175 (Why is no real title available?)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• A new graph radio k-coloring algorithm
• scientific article; zbMATH DE number 2123365 (Why is no real title available?)
• A lower bound technique for radio k-coloring
• On the radio number for corona of paths and cycles
• Upper bound for radio k-chromatic number of graphs in connection with partition of vertex set
• Radio \(k\)-labeling of paths
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• A linear algorithm for radio k-coloring of powers of paths having small diameters
• Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies

This page was built for publication: A graph radio \(k\)-coloring algorithm

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