Radio numbers of some caterpillars
From MaRDI portal
Publication:324983
DOI10.1016/J.ENDM.2015.05.043zbMATH Open1347.05197OpenAlexW816918706MaRDI QIDQ324983FDOQ324983
Authors: Srinivasa Rao Kola, Pratima Panigrahi
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.043
Recommendations
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Radio number for trees
- Radio labelings of graphs
- Title not available (Why is that?)
- Linear and cyclic radio k-labelings of trees
- 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
- A survey on radio \(k\)-colorings of graphs
- Optimal radio labellings of complete \(m\)-ary trees
Cited In (9)
- On the radio \(k\)-chromatic number of some classes of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Radio number of trees
- Radio numbers of certain \(m\)-distant trees
- Optimal radiocoloring of trees
- The radio number of standard caterpillars
- Burning number of caterpillars
- Radio number of trees
This page was built for publication: Radio numbers of some caterpillars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324983)