A new type of edge-derived vertex coloring

DOI10.1016/j.disc.2008.11.014zbMath1198.05050OpenAlexW2090401304MaRDI QIDQ1045165

Cory Palmer, Ervin Gyoeri

Publication date: 15 December 2009

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

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

zbMATH Keywords

edge coloringchromatic numberedge-weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (4)

A relaxed case on 1-2-3 conjecture ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing

Cites Work

• Unnamed Item
• Adjacent strong edge coloring of graphs
• Edge weights and vertex colours
• General neighbour-distinguishing index of a graph
• Vertex colouring edge partitions
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: A new type of edge-derived vertex coloring