The strong chromatic index of graphs with edge weight eight

DOI10.1007/s10878-020-00582-4zbMath1445.05038OpenAlexW3025086567MaRDI QIDQ2185830

Ren Zhao, Lily Chen, Shumei Chen, Xiangqian Zhou

Publication date: 5 June 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00582-4

zbMATH Keywords

strong chromatic indexstrong edge-coloringedge weight

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (2)

Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Injective edge-coloring of graphs with small weight

Cites Work

• Unnamed Item
• The strong chromatic index of a class of graphs
• Strong chromatic index of graphs with maximum degree four
• The strong edge-coloring for graphs with small edge weight
• Strong edge chromatic index of the generalized Petersen graphs
• Strong chromatic index of unit distance graphs
• On Representatives of Subsets
• Recent progress on strong edge-coloring of graphs

This page was built for publication: The strong chromatic index of graphs with edge weight eight