A planar graph construction using signed Wenger gadgets disproves the conjecture that every planar graph has fractional arboricity at most 2.
Balanced-chromatic number and hadwiger-like conjectures.Priprint, 2024+
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Fractional balanced chromatic number and arboricity of planar (signed) graphs
A planar graph construction using signed Wenger gadgets disproves the conjecture that every planar graph has fractional arboricity at most 2.