On the adjacent vertex distinguishing edge colourings of graphs

DOI10.1080/00207160801998926zbMath1203.05055OpenAlexW2053661659MaRDI QIDQ3568414

Bin Liu, Gui Zhen Liu

Publication date: 11 June 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160801998926

zbMATH Keywords

graph theoryedge colouringadjacent vertex distinguishing edge chromatic numberadjacent vertex distinguishing edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing

Cites Work

• Unnamed Item
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

This page was built for publication: On the adjacent vertex distinguishing edge colourings of graphs