Decomposition of multigraphs into isomorphic graphs with two edges
The authors consider the question of decomposing the edge set of a given graph into disjoint subsets, each of them inducing a subgraph isomorphic to a parameter graph \(H\). They solve the question for two-edge graphs \(H\) giving characterization theorems and polynomial time decision algorithms for the cases of \(H\) being two disjoint edges and a path of length two (the case of \(H\) being a duplicate edge is trivial, in that case \(G\) has a decomposition if and only if every edge of \(G\) has even multiplicity). Their algorithms improve on the time complexity of previously known ones.
- \(\vec{P_3}\)-decomposition of directed graphs
- Edge decompositions and rooted packings of graphs
- Multigraph decomposition into multigraphs with two underlying edges
- Decomposition of multigraphs
- Decompositions of multigraphs into parts with two edges
- Edge decompositions of multigraphs into multi-2-paths
- Decomposition of class II graphs into two class I graphs
- A note on the decomposition of graphs into isomorphic matchings
This page was built for publication: Decomposition of multigraphs into isomorphic graphs with two edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2761048)
