Showing 2026Show all
2 papers · 1 filter
math.CO2026
On k-coalition partitions of graphs
Claire Kaneshiro
In a graph, a set is -dominating if every vertex in has at least neighbors in . Jafari, Alikhani, and Bakhshesh introduced the concept of a -coa…
math.CO2026
Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs
Maria Chudnovsky, Julien Codsi, Claire Kaneshiro
It is a classical theorem of Robertson and Seymour (1986) that the treewidth of a graph is linearly related to its separation number: the smallest integer such that, for every…