Partitions of multigraphs without C₄
From MaRDI portal
Publication:2053675
Recommendations
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- On multigraphs with a given partition
- Counting 4 4 matrix partitions of graphs
- On the choice number of complete multipartite graphs with part size four
- Partitions of graphs and multigraphs under degree constraints
- Vertex partitions of \(K_{4,4}\)-minor free graphs
- On the multidecompositions of the complete multipartite graphs into the graph-pair of order 4
- Partitioning digraphs with outdegree at least 4
- Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
- scientific article; zbMATH DE number 4008444
Cites work
- A note on partitions of graphs under degree constraints
- Decomposing C₄-free graphs under degree constraints
- Decomposing graphs with girth at least five under degree constraints
- Decomposing weighted graphs
- Efficient algorithms for decomposing graphs under degree constraints
- Graph decomposition with constraints on the connectivity and minimum degree
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- scientific article; zbMATH DE number 2104729 (Why is no real title available?)
- On a conjecture of Schweser and Stiebitz
- On decomposition of triangle-free graphs under degree constraints
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- On partitions of graphs under degree constraints
- Partition of graphs with condition on the connectivity and minimum degree
- Partitions of graphs and multigraphs under degree constraints
- Partitions of multigraphs under minimum degree constraints
Cited in
(9)- Partitions of multigraphs under minimum degree constraints
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- Partitions of graphs and multigraphs under degree constraints
- \(C_{4p}\)-frame of complete multipartite multigraphs
- On a conjecture of Schweser and Stiebitz
- On connected partition with degree constraints
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
- Decomposing C₄-free graphs under degree constraints
- Distribution of vertices required a high-degree condition on partitions of graphs under degree constraints
This page was built for publication: Partitions of multigraphs without \(C_4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053675)