The list balancing number always exists, coincides with the balancing number when the latter does, and is exactly determined for cycles except 4k-cycles (tight bounds) with general bounds via extremal numbers and a surprisingly large value for K5.
Co lored unavoidable patterns and bal- anceable graphs, arXiv preprint
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2020 2verdicts
UNVERDICTED 2representative citing papers
New sufficient conditions are derived and applied to fully characterize balanceability for rectangular and triangular grids plus certain circulant graphs.
citing papers explorer
-
The balancing number and list balancing number of some graph classes
The list balancing number always exists, coincides with the balancing number when the latter does, and is exactly determined for cycles except 4k-cycles (tight bounds) with general bounds via extremal numbers and a surprisingly large value for K5.
-
On the balanceability of some graph classes
New sufficient conditions are derived and applied to fully characterize balanceability for rectangular and triangular grids plus certain circulant graphs.