The algorithm for adjacent vertex distinguishing proper edge coloring of graphs

DOI10.1142/S1793830915500445zbMath1331.05079OpenAlexW1844520552MaRDI QIDQ2788720

Fei Wen, Tengyun Hu, Jing-wen Li

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500445

zbMATH Keywords

algorithmgraphadjacent vertex distinguishing proper edge chromatic numberadjacent vertex distinguishing proper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• A note on adjacent strong edge coloring of \(K(n,m)\)
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Vertex-distinguishing proper edge-colorings
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: The algorithm for adjacent vertex distinguishing proper edge coloring of graphs