Strong edge-colorings for \(k\)-degenerate graphs

DOI10.1007/s00373-014-1478-1zbMath1321.05096arXiv1212.6093OpenAlexW2000072073MaRDI QIDQ497384

Gexin Yu

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.6093

zbMATH Keywords

induced matching\(k\)-degenerate graphsstrong edge-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (10)

On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong chromatic index of graphs with maximum degree four ⋮ List strong edge-coloring of graphs with maximum degree 4 ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong edge-coloring of 2-degenerate graphs ⋮ A note on strong edge coloring of sparse graphs ⋮ Strong chromatic index of \(k\)-degenerate graphs ⋮ Note on injective edge-coloring of graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A bound on the strong chromatic index of a graph
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs

This page was built for publication: Strong edge-colorings for \(k\)-degenerate graphs