Strong edge coloring of circle graphs

DOI10.1016/j.ejc.2022.103507zbMath1486.05086OpenAlexW4210610621MaRDI QIDQ2122690

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

Publication date: 7 April 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2022.103507

zbMATH Keywords

strong chromatic indexmaximum size of a strong clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On list \(r\)-hued coloring of outer-1-planar graphs

Cites Work

• Clique number of the square of a line graph
• The strong chromatic index of sparse graphs
• Strong chromatic index of \(K_{1, t}\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The complexity of domination problems in circle graphs
• A bound on the strong chromatic index of a graph
• Strong cliques and forbidden cycles
• The Complexity of Coloring Circular Arcs and Chords
• The strong chromatic index ofC4-free graphs
• A Stronger Bound for the Strong Chromatic Index
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong edge coloring of circle graphs