The strong chromatic index of a class of graphs

DOI10.1016/j.disc.2007.11.051zbMath1214.05033OpenAlexW2051010614MaRDI QIDQ998363

Jianzhuan Wu, Wensong Lin

Publication date: 28 January 2009

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

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

zbMATH Keywords

line graphinduced matchingstrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (23)

Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ On the strong chromatic index of sparse graphs ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ Strong edge-coloring of cubic bipartite graphs: a counterexample ⋮ Strong chromatic index of graphs with maximum degree four ⋮ The strong chromatic index of graphs with edge weight eight ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ List strong edge-colorings of sparse graphs ⋮ Strong edge-coloring for cubic Halin graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Distance two edge labelings of lattices ⋮ Unnamed Item ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ On \((s,t)\)-relaxed strong edge-coloring of graphs ⋮ Strong edge-coloring for jellyfish graphs ⋮ The strong edge-coloring for graphs with small edge weight ⋮ Recent progress on strong edge-coloring of graphs ⋮ Injective edge-coloring of graphs with small weight

Cites Work

• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Labelling Graphs with a Condition at Distance 2
• Induced matchings in cubic graphs
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The strong chromatic index of a class of graphs