A note on adjacent strong edge coloring of K(n,m)

DOI10.1007/S10255-006-0303-XMaRDI QIDQ2431949zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• Adjacent strong edge coloring of graphs
• On the complete chromatic number of Halin graphs
• On the edge-binding number of some plane graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• The edge coloring classification of the generalized \(K(4,n)\) graphs and the generalized Griozsch graphs \(G_n\)
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing proper edge-colorings

Cited in

(9)

• scientific article; zbMATH DE number 6613706 (Why is no real title available?)
• scientific article; zbMATH DE number 5905150 (Why is no real title available?)
• scientific article; zbMATH DE number 5024672 (Why is no real title available?)
• scientific article; zbMATH DE number 2073993 (Why is no real title available?)
• \(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 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)