Counting connected partitions of graphs
From MaRDI portal
Publication:6606326
DOI10.1002/JGT.23127zbMATH Open1547.05135MaRDI QIDQ6606326FDOQ6606326
Authors: Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer 
Publication date: 16 September 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Recommendations
Enumeration in graph theory (05C30) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Judicious partitions of uniform hypergraphs
- On the complexity of partitioning graphs into connected subgraphs
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- Title not available (Why is that?)
- The distribution of the number of summands in the partitions of a positive integer
- On partitioning the edges of graphs into connected subgraphs
- Max-cut under graph constraints
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- The connectivity of line-graphs
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
- More aspects of arbitrarily partitionable graphs
This page was built for publication: Counting connected partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606326)
