2 papers
math.CO2026
The Chromatic Symmetric Function for Unicyclic Graphs
Aram Bingham, Lisa Johnston, Colin Lawson +3
Motivated by the question of which structural properties of a graph can be recovered from the chromatic symmetric function (CSF), we study the CSF of connected unicyclic graphs. Wh…
math.CO2025
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
F. Botler, Y. S. Couto, C. G. Fernandes +4
Chernyshev, Rauch, and Rautenbach proved that every connected graph on vertices with less than edges has a vertex cut that induces a forest, and co…