Counting connected partitions of graphs

DOI10.1002/jgt.23127zbMATH Open1547.05135MaRDI QIDQ6606326

Zsolt Tuza, Máté Vizer, Yair Caro, Balázs Patkós

Publication date: 16 September 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

graph partitionsconnected partitions

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Judicious partitions of uniform hypergraphs
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
• On the complexity of partitioning graphs into connected subgraphs
• More aspects of arbitrarily partitionable graphs
• On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
• Approximation algorithms for connected maximum cut and related problems
• The connectivity of line-graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• The distribution of the number of summands in the partitions of a positive integer
• Max-Cut Under Graph Constraints
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On partitioning the edges of graphs into connected subgraphs
• A homology theory for spanning tress of a graph

This page was built for publication: Counting connected partitions of graphs