Graphs missing a connected partition

DOI10.1016/J.AAM.2026.103044MaRDI QIDQ6856316zbMATH OpenFDO

Authors Foster Tom

Publication date 19 February 2026

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AAM.2026.103044

zbMATH Keywords

chromatic symmetric functionconnected partitioncut vertexe-positivegraph partitionStanley-Stembridge conjecturetree isomorphism conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Symmetric functions and generalizations (05E05)

Cites work

• A symmetric function generalization of the chromatic polynomial of a graph
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Balanced graph partitioning
• Doubly balanced connected graph partitioning
• Graph clustering
• Maximal Flow Through a Network
• On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
• On the \(e\)-positivity of trees and spiders
• Partitioning graphs into connected parts
• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
• Schur and \(e\)-positivity of trees and cut vertices
• The \(e\)-positivity and Schur positivity of some spiders and broom trees
• The price of connectivity in fair division

This page was built for publication: Graphs missing a connected partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856316)