An upper bound of adjacent strong edge chromatic number

MaRDI QIDQ3538546zbMATH OpenFDO

Authors Xinmei Zhao

Publication date 24 November 2008

zbMATH Keywords

graphedge coloringadjacent strong edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Upper bounds for adjacent vertex-distinguishing edge coloring
• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• An asymptotic bound for the strong chromatic number
• Upper bound on 2-strong edge chromatic numbers of graphs

Cited in

(3)

• scientific article; zbMATH DE number 2073993 (Why is no real title available?)
• scientific article; zbMATH DE number 5847230 (Why is no real title available?)
• Precise upper bound for the strong edge chromatic number of sparse planar graphs

This page was built for publication: An upper bound of adjacent strong edge chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538546)