Coloring, list coloring, and painting squares of graphs (and other related problems)
From MaRDI portal
Publication:6115243
DOI10.37236/10898zbMATH Open1519.05072arXiv2210.05915MaRDI QIDQ6115243
Publication date: 16 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We survey work on coloring, list coloring, and painting squares of graphs; in particular, we consider strong edge-coloring. We focus primarily on planar graphs and other sparse classes of graphs.
Full work available at URL: https://arxiv.org/abs/2210.05915
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Unnamed Item ⋮ Bounding clique size in squares of planar graphs ⋮ Improved 2-distance coloring of planar graphs with maximum degree 5 ⋮ Cliques in squares of graphs with maximum average degree less than 4
This page was built for publication: Coloring, list coloring, and painting squares of graphs (and other related problems)
