Vertex-distinguishing proper edge colourings of some regular graphs

DOI10.1016/j.disc.2007.07.019zbMath1131.05043OpenAlexW2063524445MaRDI QIDQ2470446

Roman Soták, Janka Rudašová

Publication date: 14 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.019

zbMATH Keywords

edge colouringequitable colouringvertex-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Vertex-distinguishing proper arc colorings of digraphs ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the vertex-distinguishing proper edge-colorings of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• Balanced edge colorings.
• The observability of the Fibonacci and the Lucas cubes
• Packing Circuits into K_N
• Vertex-distinguishing proper edge-colorings
• Vertex‐distinguishing edge colorings of random graphs

This page was built for publication: Vertex-distinguishing proper edge colourings of some regular graphs