A graph radio k-coloring algorithm
From MaRDI portal
Publication:2876567
DOI10.1007/978-3-642-35926-2_15zbMATH Open1293.68207OpenAlexW159313573MaRDI QIDQ2876567FDOQ2876567
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (16)
- On the radio number of toroidal grids
- On radio number of power of cycles
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Antipodal radio labelling of full binary trees
- Title not available (Why is that?)
- A new graph radio \(k\)-coloring algorithm
- 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
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- 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
- A lower bound technique for radio \(k\)-coloring
- Radio \(k\)-chromatic number of full \(m\)-ary trees
- Title not available (Why is that?)
- Radio \(k\)-labeling of paths
- Antipodal number of full \(m\)-ary trees
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)
