The strong edge-coloring for graphs with small edge weight

DOI10.1016/j.disc.2019.111779zbMath1433.05113OpenAlexW2995628486MaRDI QIDQ2297732

Gexin Yu, Lily Chen, Mingfang Huang, Xiangqian Zhou

Publication date: 20 February 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111779

zbMATH Keywords

strong edge-coloringedge weight

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (5)

The strong chromatic index of graphs with edge weight eight ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ List strong edge-colorings of sparse graphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Injective edge-coloring of graphs with small weight

Cites Work

• Unnamed Item
• Unnamed Item
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• On induced matchings
• A note on the strong chromatic index of bipartite graphs
• The strong chromatic index of a class of graphs
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• Strong chromatic index of graphs with maximum degree four
• Induced matchings in cubic graphs

This page was built for publication: The strong edge-coloring for graphs with small edge weight