Strong Chromatic Index of Sparse Graphs

DOI10.1002/jgt.21999zbMath1350.05045OpenAlexW1909946366MaRDI QIDQ2833251

Xuding Zhu, Daqing Yang

Publication date: 17 November 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21999

zbMATH Keywords

line graphcoloring numberstrong chromatic indexmaximum average degree of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (3)

List strong edge-coloring of graphs with maximum degree 4 ⋮ Uniform orderings for generalized coloring numbers ⋮ A note on strong edge coloring of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The strong chromatic index of sparse graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The strong chromatic index of a cubic graph is at most 10
• The game coloring number of planar graphs
• A bound on the strong chromatic index of a graph
• Strong chromatic index of \(k\)-degenerate graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Very asymmetric marking games
• On the degrees of the vertices of a directed graph
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs
• The Map-Coloring Game

This page was built for publication: Strong Chromatic Index of Sparse Graphs