Optimal radiocoloring of trees

DOI10.11568/KJM.2019.27.4.831zbMATH Open1435.05177OpenAlexW2998434310MaRDI QIDQ5221077FDOQ5221077

Authors: Xiaoling Zhang 

Publication date: 24 March 2020

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

Recommendations

• scientific article; zbMATH DE number 1953160
• On the radio \(k\)-chromatic number of some classes of trees
• Radio numbers of some caterpillars
• Radiocoloring in planar graphs: Complexity and approximations
• scientific article; zbMATH DE number 1759423

zbMATH Keywords

treeorderspancaterpillarradiocoloring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• LATIN 2004: Theoretical Informatics

This page was built for publication: Optimal radiocoloring of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221077)