On star 5-colorings of sparse graphs

DOI10.1016/j.dam.2021.02.009zbMath1459.05076arXiv1903.10133OpenAlexW3132853216MaRDI QIDQ2656970

Ilkyoo Choi, Boram Park

Publication date: 17 March 2021

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

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

zbMATH Keywords

star coloringmaximum average degreesparse graphstar 5-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• I,F-partitions of sparse graphs
• An introduction to the discharging method via graph coloring
• Star coloring high girth planar graphs
• Note to the paper of Grünbaum on acyclic colorings
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On acyclic colorings of planar graphs
• On a star chromatic index of subcubic graphs
• List star edge coloring of sparse graphs
• Coloring with no 2-colored \(P_4\)'s
• Colorings of plane graphs: a survey
• Star list chromatic number of planar subcubic graphs
• Star coloring of graphs
• Star coloring planar graphs from small lists
• Star coloring bipartite planar graphs
• Star coloring of sparse graphs
• Star chromatic index of subcubic multigraphs
• 6-Star-Coloring of Subcubic Graphs
• Star Chromatic Index
• Acyclic colorings of planar graphs