Calculating an upper bound of the locating-chromatic number of trees

DOI10.1016/J.TCS.2019.04.011MaRDI QIDQ2285138zbMATHOpenAlexWikidataFDO

Authors Dian Kastika Syofyan, H. Assiyatun, E. T. Baskoro

Publication date 16 January 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.04.011

zbMATH Keywords

treegraph algorithmupper boundlocating-chromatic number

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Improved algorithm for the locating-chromatic number of trees
• Upper bounds on the locating chromatic number of trees
• A bound for the locating chromatic number of trees
• Characterizing all trees with locating-chromatic number 3
• scientific article; zbMATH DE number 1869706

Cites work

• scientific article; zbMATH DE number 1869706 (Why is no real title available?)
• Characterizing all trees with locating-chromatic number 3
• On locating-chromatic number of complete \(n\)-ary tree
• On the locating-chromatic number of homogeneous lobsters
• The locating-chromatic number of firecracker graphs
• Upper bounds on the locating chromatic number of trees

Cited in

(5)

• Upper bounds on the locating chromatic number of trees
• On locating and neighbor-locating colorings of sparse graphs
• On ( k , ℓ )-locating colorings of graphs
• Improved algorithm for the locating-chromatic number of trees
• The locating chromatic number for m-shadow of a connected graph

This page was built for publication: Calculating an upper bound of the locating-chromatic number of trees

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