A note on adjacent strong edge coloring of \(K(n,m)\)
From MaRDI portal
Publication:2431949
DOI10.1007/s10255-006-0303-xzbMath1101.05031OpenAlexW2010741452MaRDI QIDQ2431949
Yirong Sun, Xiang'en Chen, Jing-wen Li, Zhong Fu Zhang
Publication date: 24 October 2006
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-006-0303-x
Related Items (5)
\(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Equitable edge coloring on tensor product of graphs ⋮ On the inclusion chromatic index of a graph ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ Equitable total coloring of \(F_n \vee W_n\)
Cites Work
- Unnamed Item
- Unnamed Item
- On the vertex-distinguishing proper edge-colorings of graphs
- On the complete chromatic number of Halin graphs
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
- On the edge-binding number of some plane graphs
This page was built for publication: A note on adjacent strong edge coloring of \(K(n,m)\)
