The locating-chromatic number for Halin graphs

DOI10.22049/CCO.2017.13577zbMATH Open1386.05064OpenAlexW2596197192MaRDI QIDQ4598299FDOQ4598299

Authors: I. A. Purwasih, E. T. Baskoro, H. Assiyatun, Djoko Suprijanto, Martin Bača 

Publication date: 20 December 2017

Full work available at URL: https://doaj.org/article/bbd671e1c0b34829b89f6a2f05246f59

Recommendations

• The locating-chromatic number of certain Halin graphs
• Locating chromatic number of powers of paths and cycles
• Characterizing all trees with locating-chromatic number 3
• scientific article; zbMATH DE number 6413923
• On the locating chromatic number of the Cartesian product of graphs.

zbMATH Keywords

double starlocating-chromatic numberHalin

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cited In (13)

• The locating-chromatic number for a subdivision of a wheel on one cycle edge
• The locating chromatic number for m-shadow of a connected graph
• The locating-chromatic number of certain Halin graphs
• The locating chromatic number of the join of graphs
• Locating chromatic number of middle graph of path, cycle, star, wheel, gear and helm graphs
• New bounds and constructions for neighbor-locating colorings of graphs
• On the locating-chromatic number of homogeneous lobsters
• A bound for the locating chromatic number of trees
• The locating-chromatic number of firecracker graphs
• On the conjectures of neighbor locating coloring of graphs
• On ( k , ℓ )-locating colorings of graphs
• Neighbor-locating colorings in graphs
• On the locating-chromatic numbers of subdivisions of friendship graph

This page was built for publication: The locating-chromatic number for Halin graphs

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