Distance-constrained labeling of complete trees

DOI10.1016/J.DISC.2015.02.016zbMath1310.05181OpenAlexW2082485748MaRDI QIDQ2342628

Veronika Halász, Zsolt Tuza

Publication date: 29 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.02.016

zbMATH Keywords

graph coloringcomplete treeradio labelingradio numbermulti-level distance labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Further results on the radio number of trees ⋮ Radio number for the Cartesian product of two trees ⋮ Radio number of trees ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees

Cites Work

• \(L(3,2,1)\)-labeling of graphs
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Optimal radio labellings of complete \(m\)-ary trees
• Radio number for trees
• The Radio Number of $C_n \square C_n$
• Radio number of ladder graphs
• Radio k-labelings for Cartesian products of graphs
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-constrained labeling of complete trees