On the multidecompositions of the complete multipartite graphs into the graph-pair of order 4
From MaRDI portal
Publication:2948814
Recommendations
- Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.
- Multidesigns for graph-pairs of order 4 and 5
- Multidecomposition of \(K_n-F\) into graph-pairs of order 5 where \(F\) is a Hamilton cycle or an (almost) 1-factor.
- Decompositions of complete graphs with holes of the same size into the graph-pair of order 4
- scientific article; zbMATH DE number 2186980
Cited in
(9)- Decompositions of complete graphs with holes of the same size into the graph-pair of order 4
- Multidesigns for graph-pairs of order 4 and 5
- \(C_{4p}\)-frame of complete multipartite multigraphs
- On \(P_4\)-decomposition of graphs
- scientific article; zbMATH DE number 1792591 (Why is no real title available?)
- Partitions of multigraphs without \(C_4\)
- Multidecomposition of \(K_n-F\) into graph-pairs of order 5 where \(F\) is a Hamilton cycle or an (almost) 1-factor.
- On the choice number of complete multipartite graphs with part size four
- Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.
This page was built for publication: On the multidecompositions of the complete multipartite graphs into the graph-pair of order 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948814)
