On the adjacent vertex-distinguishing equitable edge coloring of graphs

DOI10.1007/s10255-013-0239-xzbMath1277.05066OpenAlexW2093898020MaRDI QIDQ385210

Jing-wen Li, Zhi-wen Wang, Cong Wang

Publication date: 2 December 2013

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-013-0239-x

zbMATH Keywords

adjacent vertex-distinguishing edge coloringadjacent vertex-distinguishing equitable edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(r\)-strong edge colorings of graphs
• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Incidence and strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• The observability of the Fibonacci and the Lucas cubes
• Vertex distinguishing equitable total chromatic number of join 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

This page was built for publication: On the adjacent vertex-distinguishing equitable edge coloring of graphs