I,F-partitions of sparse graphs

DOI10.1016/j.ejc.2016.03.003zbMath1339.05300arXiv1510.03381OpenAlexW2963476037MaRDI QIDQ298327

Mohit Kumbhat, Derrick Stolee, Axel Brandt, Sarah Loeb, Michael Ferrara, Matthew P. Yancey

Publication date: 20 June 2016

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

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

zbMATH Keywords

potential functionsdischargingstar \(k\)-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items

On star 5-colorings of sparse graphs, Additive list coloring of planar graphs with given girth, An introduction to the discharging method via graph coloring, Planar graphs with girth 20 are additively 3-choosable

Cites Work

• Unnamed Item
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• On 1-improper 2-coloring of sparse graphs
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Ore's conjecture on color-critical graphs is almost true
• Star coloring high girth planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On acyclic colorings of planar graphs
• Coloring with no 2-colored \(P_4\)'s
• Colorings of plane graphs: a survey
• Star coloring planar graphs from small lists
• Star coloring bipartite planar graphs
• Star coloring of sparse graphs
• Acyclic colorings of planar graphs