Introduces strong majority colorings and proves Maj(G) is arbitrarily large yet at most 2Δ(G)+1 without pendants, while Maj'(G) has a constant upper bound conjectured to be 4 and verified on many classes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Strong majority colorings of graphs
Introduces strong majority colorings and proves Maj(G) is arbitrarily large yet at most 2Δ(G)+1 without pendants, while Maj'(G) has a constant upper bound conjectured to be 4 and verified on many classes.