Counting connected partitions of graphs
From MaRDI portal
Publication:6606326
Recommendations
Cites work
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 2191994 (Why is no real title available?)
- scientific article; zbMATH DE number 7768372 (Why is no real title available?)
- A homology theory for spanning tress of a graph
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- Edge-Disjoint Spanning Trees of Finite Graphs
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Judicious partitions of uniform hypergraphs
- Max-cut under graph constraints
- More aspects of arbitrarily partitionable graphs
- On partitioning the edges of graphs into connected subgraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- On the complexity of partitioning graphs into connected subgraphs
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
- The connectivity of line-graphs
- The distribution of the number of summands in the partitions of a positive integer
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)