Showing math.COShow all
2 papers · 1 filter
math.CO2026
An elementary proof of a tight bound for the additive chromatic number
Alex Koutsoutis, Joseph Koutsoutis
An additive coloring assigns positive integer labels to the vertices of a graph so that adjacent vertices have different sums of their neighbors' labels. The additive chromatic num…
math.CO2025
On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
Alex Koutsoutis, Kilian Krause, Chun-Hung Liu +2
We investigate two recently introduced graph parameters, both of which measure the complexity of the tree decompositions of a given graph. Recall that the treewidth o…