An upper bound of star-edge-star total chromatic number of graphs

zbMATH Open1265.05240MaRDI QIDQ4901280FDOQ4901280

Authors:

Publication date: 24 January 2013

Recommendations

• On the star chromatic number of \(D (C_n)\), \(C^2_n\) and \(C^3_n\)
• An upper bound on the star chromatic index of graphs with \(\varDelta\geqslant 7\)
• A bound on the total chromatic number
• A new upper bound for total colourings of graphs
• Star edge coloring of graphs with \(\mathrm{Mad}(G)<\frac{14}{5}\)

zbMATH Keywords

probabilistic methodLovász local lemmastar-edge-star total chromatic numberstar-edge-star total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• An upper bound on the star chromatic index of graphs with \(\varDelta\geqslant 7\)
• Improved upper bound for the degenerate and star chromatic numbers of graphs
• On strict-double-bound numbers of complete graphs without edges of stars and pans

This page was built for publication: An upper bound of star-edge-star total chromatic number of graphs

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