The strong chromatic index of graphs with restricted Ore-degrees.

zbMATH Open1349.05065MaRDI QIDQ2804765FDOQ2804765

Kittikorn Nakprasit, Keaitsuda Nakprasit

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• The strong chromatic index of a class of graphs
• A bound on the strong chromatic index of a graph
• Odd graph and its applications to the strong edge coloring
• Publication:3201075
• On strong edge-coloring of graphs with maximum degree 4

zbMATH Keywords

strong chromatic indexstrong edge-coloringOre-degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
• Strong list-chromatic index of planar graphs with Ore-degree at most seven

This page was built for publication: The strong chromatic index of graphs with restricted Ore-degrees.

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