Partition of a graph with its complete sub-graphs
From MaRDI portal
Recommendations
- Complete partitions of graphs
- Complete partitions of graphs
- Partitioning a graph into complementary subgraphs
- Partitioning a graph into complementary subgraphs
- Partitioning graphs into complete and empty graphs
- Partitions of Graphs
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- Complete subgraphs in a multipartite graph
- scientific article; zbMATH DE number 4008444
- Distinguishing partitions of complete multipartite graphs
Cited in
(13)- Partitioning graphs into complete and empty graphs
- Graphs without a partition into two proportionally dense subgraphs
- Partitioning a graph into two pieces, each isomorphic to the other or to its complement
- Complete partitions of graphs
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- scientific article; zbMATH DE number 5077172 (Why is no real title available?)
- scientific article; zbMATH DE number 4008444 (Why is no real title available?)
- Bipartitions based on degree constraints
- scientific article; zbMATH DE number 4187858 (Why is no real title available?)
- Partitioning a graph into complementary subgraphs
- Complete (2,2) Bipartite Graphs
- Complete partitions of graphs
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
This page was built for publication: Partition of a graph with its complete sub-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915790)
