Coloring, list coloring, and painting squares of graphs (and other related problems)

DOI10.37236/10898MaRDI QIDQ6115243zbMATH OpenFDO

Authors Daniel W. Cranston

Publication date 16 August 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

list coloringpainting squares of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

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.

Recommendations

• scientific article; zbMATH DE number 1347005
• Strong edge-colouring of sparse planar graphs
• List coloring the square of sparse graphs with large degree
• scientific article; zbMATH DE number 446487
• scientific article; zbMATH DE number 7266772

Cited in

(4)

• From puzzles to graphs to colorings
• Cliques in squares of graphs with maximum average degree less than 4
• Bounding clique size in squares of planar graphs
• Improved 2-distance coloring of planar graphs with maximum degree 5

This page was built for publication: Coloring, list coloring, and painting squares of graphs (and other related problems)

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