Every simple planar graph without 4-cycles and intersecting triangles is weighted ε-flexibly DP-4-colorable.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
The fractional list packing number χ_ℓ^•(G) is at most the pathwidth of G plus one, with additional bounds for Cartesian products and d-degenerate graphs.
citing papers explorer
-
Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
Every simple planar graph without 4-cycles and intersecting triangles is weighted ε-flexibly DP-4-colorable.
-
Fractional list packing for layered graphs
The fractional list packing number χ_ℓ^•(G) is at most the pathwidth of G plus one, with additional bounds for Cartesian products and d-degenerate graphs.