AVD proper edge-coloring of some families of graphs

DOI10.1142/S2661335222500010zbMath1500.05019MaRDI QIDQ5042557

J. Naveen

Publication date: 20 October 2022

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

zbMATH Keywords

cycleedge-coloringpathshadow graphsplitting graphmiddle graph\(H\)-graphAVD proper edge-coloringtriangular grid \(T_n\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on adjacent vertex distinguishing colorings of graphs
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Packing colouring of some classes of cubic graphs
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: AVD proper edge-coloring of some families of graphs