Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound

DOI10.1016/j.disc.2013.01.026zbMath1277.05069OpenAlexW2057473864MaRDI QIDQ383771

Martina Mockovčiaková, Roman Soták

Publication date: 6 December 2013

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

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

zbMATH Keywords

circulant graphvertex-distinguishing coloring\(d\)-strong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs, Distant set distinguishing total colourings of graphs, Distant set distinguishing edge colourings of graphs, \(d\)-strong total colorings of graphs

Cites Work

• \(r\)-strong edge colorings of graphs
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• Adjacent strong edge coloring of graphs
• \(d\)-strong edge colorings of graphs
• Vertex-distinguishing proper edge colourings of some regular graphs
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item