Integrated colorings are enumerated for four graph families, the mixing-number distribution is derived for paths and cycles, a central limit theorem is proved, and a general upper bound on ic(G) is obtained.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
Integrated colorings are enumerated for four graph families, the mixing-number distribution is derived for paths and cycles, a central limit theorem is proved, and a general upper bound on ic(G) is obtained.