General neighbour-distinguishing index of a graph

DOI10.1016/j.disc.2007.07.046zbMath1143.05028OpenAlexW2011090265MaRDI QIDQ2470450

Mirko Horňák, Cory Palmer, Mariusz Woźniak, Ervin Gyoeri

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.046

zbMATH Keywords

edge colouringcolour set, general neighbour-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A note on adjacent vertex distinguishing colorings of graphs, On defected colourings of graphs, The neighbour-sum-distinguishing edge-colouring game, A note on edge weightings inducing proper vertex colorings, General neighbour-distinguishing index via chromatic number, Graph coloring with cardinality constraints on the neighborhoods, Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs, A new type of edge-derived vertex coloring, General vertex-distinguishing total coloring of graphs, On neighbour-distinguishing colourings from lists, Not necessarily proper total colourings which are adjacent vertex distinguishing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the neighbour-distinguishing index of a graph
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
• Adjacent Vertex Distinguishing Edge‐Colorings