On \((s,t)\)-relaxed strong edge-coloring of graphs

DOI10.1007/s10878-015-9983-6zbMath1359.05040OpenAlexW2227950926MaRDI QIDQ511712

Dan He, Wensong Lin

Publication date: 22 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-015-9983-6

zbMATH Keywords

strong chromatic indexstrong edge-coloring\((s, t)\)-relaxed strong chromatic index\((s,t)\)-relaxed strong edge-coloringinfinite \(\Delta\)-regular tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs

Cites Work

• The strong chromatic index of a class of graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index ofC4-free graphs
• Semistrong edge coloring of graphs
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \((s,t)\)-relaxed strong edge-coloring of graphs