Large n-vertex graphs with max degree Delta admit an equitable tree k-colouring for k >= (Delta+2)/2 when n >= 3 Delta^4.
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
-
Equitable tree colouring of graphs
Large n-vertex graphs with max degree Delta admit an equitable tree k-colouring for k >= (Delta+2)/2 when n >= 3 Delta^4.