Strong chromatic index of \(K_{1, t}\)-free graphs

DOI10.1016/J.DAM.2020.03.024zbMath1443.05065OpenAlexW3012703112MaRDI QIDQ777360

Małgorzata Śleszyńska-Nowak, Michał Dębski, Konstanty Junosza-Szaniawski

Publication date: 7 July 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.024

zbMATH Keywords

claw-free graphsstrong chromatic indexunit disk graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Strong edge coloring of circle graphs ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ Strong cliques in claw-free graphs ⋮ On strong edge-coloring of claw-free subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong chromatic index of sparse graphs
• Strong edge-colorings for \(k\)-degenerate graphs
• Strong chromatic index of subcubic planar multigraphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• A bound on the strong chromatic index of a graph
• Unit disk graph recognition is NP-hard
• Strong chromatic index of graphs with maximum degree four
• Strong chromatic index of \(k\)-degenerate graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong Chromatic Index of Chordless Graphs
• The strong chromatic index ofC4-free graphs
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs
• The Strong Chromatic Index of Random Graphs
• Strong edge-coloring of planar graphs

This page was built for publication: Strong chromatic index of \(K_{1, t}\)-free graphs