\(d\)-strong edge colorings of graphs

DOI10.1007/s00373-012-1251-2zbMath1295.05108OpenAlexW1978273318MaRDI QIDQ2441359

Arnfried Kemnitz, Massimiliano Marangio

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1251-2

zbMATH Keywords

observabilityedge coloringstrong edge coloringvertex distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ Distant set distinguishing edge colourings of graphs

Cites Work

• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Adjacent Vertex Distinguishing Edge‐Colorings
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(d\)-strong edge colorings of graphs