On the locating-chromatic numbers of subdivisions of friendship graph

DOI10.22342/JIMS.26.2.822.175-184MaRDI QIDQ5142014zbMATH OpenOpenAlexFDO

Authors Brilly Maxel Salindeho, H. Assiyatun, E. T. Baskoro

Publication date 29 December 2020

Published in Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22342/jims.26.2.822.175-184

zbMATH Keywords

locating coloringsubdivisionfriendship graphlocating-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The locating-chromatic number for a subdivision of a wheel on one cycle edge
• The locating-chromatic number of firecracker graphs
• scientific article; zbMATH DE number 1869706
• Characterizing all trees with locating-chromatic number 3
• Characterizing all graphs containing cycles with locating-chromatic number 3

Cites work

• A bound for the locating chromatic number of trees
• Characterizing all trees with locating-chromatic number 3
• On the locating chromatic number of certain barbell graphs
• On the locating chromatic number of the Cartesian product of graphs.
• The locating chromatic number of the join of graphs
• The locating-chromatic number for Halin graphs

Cited in

(5)

• On the locating chromatic number of certain barbell graphs
• The locating-chromatic number of certain Halin graphs
• The locating-chromatic number of disconnected graphs
• Neighbor-locating colorings in graphs
• Neighbor-locating coloring: graph operations and extremal cardinalities

This page was built for publication: On the locating-chromatic numbers of subdivisions of friendship graph

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