New constructions show planar graphs can fail 3-defective 3-correspondence colorings, a 1-defective 3-correspondable but not 4-correspondable planar graph exists, and all outerplanar graphs are 3-defective 2-correspondence colorable, but a load-bearing lemma is false.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Defective correspondence coloring of planar graphs
New constructions show planar graphs can fail 3-defective 3-correspondence colorings, a 1-defective 3-correspondable but not 4-correspondable planar graph exists, and all outerplanar graphs are 3-defective 2-correspondence colorable, but a load-bearing lemma is false.