Strong edge colorings of graphs

DOI10.1016/0012-365X(95)00102-3zbMath0859.05042OpenAlexW1978313309MaRDI QIDQ1126183

Hao Li, Richard H. Schelp, Odile Favaron

Publication date: 7 April 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00102-3

zbMATH Keywords

edge-coloringstrong coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Kaleidoscopic colorings of graphs ⋮ On the neighbour-distinguishing index of a graph ⋮ \(r\)-strong edge colorings of graphs ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ \(d\)-strong edge colorings of graphs ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ Balanced edge colorings. ⋮ On the adjacent-vertex-strongly-distinguishing total coloring of graphs ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ On the vertex-distinguishing proper edge-colorings of graphs

Cites Work

• Vertex-distinguishing proper edge-colorings
• Unnamed Item

This page was built for publication: Strong edge colorings of graphs