A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

DOI10.1016/S0012-365X(00)00428-3zbMath0995.05063OpenAlexW1995898241MaRDI QIDQ5959088

Cristina Bazgan, Mariusz Woźniak, Hao Li, Amel Harkat-Benhamdine

Publication date: 20 March 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00428-3

zbMATH Keywords

coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Vertex-distinguishing proper arc colorings of digraphs ⋮ On the neighbour-distinguishing index of a graph ⋮ Upper bounds on vertex distinguishing chromatic indices of some Halin graphs ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ How to personalize the vertices of a graph? ⋮ \(d\)-strong edge colorings of graphs ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

This page was built for publication: A note on the vertex-distinguishing proper coloring of graphs with large minimum degree