A note on adjacent strong edge coloring of K(n,m)
From MaRDI portal
Publication:2431949
DOI10.1007/S10255-006-0303-XzbMATH Open1101.05031OpenAlexW2010741452MaRDI QIDQ2431949FDOQ2431949
Authors: Yirong Sun, Jingwen Li, Zhongfu Zhang, Xiang'en Chen 
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
Cites Work
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
- On the vertex-distinguishing proper edge-colorings of graphs
- Title not available (Why is that?)
- On the complete chromatic number of Halin graphs
- The edge coloring classification of the generalized \(K(4,n)\) graphs and the generalized Griozsch graphs \(G_n\)
- On the edge-binding number of some plane graphs
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(D(\beta)\)-vertex-distinguishing total coloring 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\)
- Equitable edge coloring on tensor product of graphs
This page was built for publication: A note on adjacent strong edge coloring of \(K(n,m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431949)
