For all graphs on at most four edges, the paper lists exact balance, strong-balance, and omnitonal numbers, and proves that the union of two bipartite graphs with the same edge count is balanceable.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On small balanceable, strongly-balanceable and omnitonal graphs
For all graphs on at most four edges, the paper lists exact balance, strong-balance, and omnitonal numbers, and proves that the union of two bipartite graphs with the same edge count is balanceable.