Strong chromatic index of K₁, t-free graphs

DOI10.1016/J.DAM.2020.03.024MaRDI QIDQ777360zbMATH OpenOpenAlexFDO

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

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

strong chromatic indexclaw-free graphsunit disk graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A bound on the strong chromatic index of a graph
• Strong chromatic index of unit distance graphs
• Strong chromatic index of \(K_4\)-minor free graphs
• The strong chromatic index of sparse graphs
• Strong chromatic index of chordless graphs

Cites work

• scientific article; zbMATH DE number 4177085 (Why is no real title available?)
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A bound on the strong chromatic index of a graph
• A stronger bound for the strong chromatic index
• Induced matchings in cubic graphs
• On six problems posed by Jarik Nešetřil
• Strong chromatic index of 2-degenerate graphs
• Strong chromatic index of \(k\)-degenerate graphs
• Strong chromatic index of chordless graphs
• Strong chromatic index of graphs with maximum degree four
• Strong chromatic index of subcubic planar multigraphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-coloring of planar graphs
• Strong edge-colorings for \(k\)-degenerate graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• The Strong Chromatic Index of Random Graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The strong chromatic index of sparse graphs
• The strong chromatic index ofC4-free graphs
• Unit disk graph recognition is NP-hard

Cited in

(11)

• On strong edge-coloring of claw-free subcubic graphs
• An algorithm on strong edge coloring of \(K_4\)-minor free graphs
• The tight bound for the strong chromatic indices of claw-free subcubic graphs
• scientific article; zbMATH DE number 5163433 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• Strong edge coloring of Cayley graphs and some product graphs
• A note on strong edge-coloring of claw-free cubic graphs
• The strong clique index of a graph with forbidden cycles
• Strong chromatic index of \(K_4\)-minor free graphs
• Strong edge coloring of circle graphs
• Strong cliques in claw-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777360)