A lower bound for radio k-chromatic number
From MaRDI portal
Publication:491602
DOI10.1016/J.DAM.2014.05.004zbMATH Open1319.05056OpenAlexW2038453821MaRDI QIDQ491602FDOQ491602
Authors: Laxman Saha, Pratima Panigrahi 
Publication date: 18 August 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.004
Recommendations
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- A lower bound technique for radio \(k\)-coloring
- Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
- A lower bound for radio \(k\)-chromatic number of an arbitrary graph
- Radio k-colorings of paths
channel assignment problemradio numberspanradio \(k\)-chromatic numberradio \(k\)-coloringantipodal number
Cites Work
- Handbook of product graphs
- Labelling Graphs with a Condition at Distance 2
- Radio number for trees
- Radio labelings of graphs
- The radio number of \(C_n\square C_n\).
- On the radio number of toroidal grids
- Title not available (Why is that?)
- Radio numbers for generalized prism graphs
- The radio antipodal and radio numbers of the hypercube.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multilevel Distance Labelings for Paths and Cycles
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- Optimal radio labellings of complete \(m\)-ary trees
- Antipodal number of some powers of cycles
- A note on radio antipodal colourings of paths.
- Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).
- On radio \((n-4)\)-chromatic number of the path \(P_n\)
- Radio antipodal colorings of cycles
- Antipodal labelings for cycles.
Cited In (27)
- On the radio \(k\)-chromatic number of some classes of trees
- Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
- On radio \((n-4)\)-chromatic number of the path \(P_n\)
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
- Antipodal radio labelling of full binary trees
- A graph radio \(k\)-coloring algorithm
- Radio-\(k\)-labeling of cycles for large \(k\)
- Optimal radio labellings of block graphs and line graphs of trees
- A new graph radio \(k\)-coloring algorithm
- Radio fuzzy graphs and assignment of frequency in radio stations
- Relationship between radio \(k\)-chromatic number of graphs and square graphs
- Title not available (Why is that?)
- On the radio number of square of graphs
- Radio graceful Hamming graphs
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- Radio k-colorings of paths
- A note on the triameter of graphs
- Triameter of graphs
- Improved bounds for some of the radio \(k\)-chromatic numbers of paths
- A lower bound for radio \(k\)-chromatic number of an arbitrary graph
- Radio \(k\)-chromatic number of cycles for large \(k\)
- 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
- Radio \(k\)-labeling of paths
- Antipodal number of full \(m\)-ary trees
This page was built for publication: A lower bound for radio \(k\)-chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491602)
