OPTIMAL RADIOCOLORING OF TREES

DOI10.11568/kjm.2019.27.4.831zbMath1435.05177OpenAlexW2998434310MaRDI QIDQ5221077

Xiao-Ling Zhang

Publication date: 24 March 2020

Full work available at URL: http://journal.kkms.org/index.php/kjm/article/download/737/497

zbMATH Keywords

treeordercaterpillarspanradiocoloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Labeling trees with a condition at distance two.
• Coloring the square of an outerplanar graph
• The \(L(2,1)\)-labelling of trees
• A survey on labeling graphs with a condition at distance two
• Radiocoloring in planar graphs: Complexity and approximations
• Labelling Graphs with a Condition at Distance 2
• Algorithms for Square Roots of Graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: OPTIMAL RADIOCOLORING OF TREES