Edge decompositions of multigraphs into multi-2-paths

MaRDI QIDQ5481339zbMATH OpenFDO

Authors Jan Kratochvíl, Zbigniew Lonc, Mariusz Meszka, Zdzisław Skupień

Publication date 9 August 2006

zbMATH Keywords

edge decompositionmultigraphmultipathpathtime complexity

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Decomposition of multigraphs
• Decomposition of multigraphs into isomorphic graphs with two edges
• On some multigraph decomposition problems and their computational complexity
• scientific article; zbMATH DE number 398969
• Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial

Cited in

(7)

• On some multigraph decomposition problems and their computational complexity
• Decomposition of multigraphs into isomorphic graphs with two edges
• Decomposing semi-complete multigraphs and directed graphs into paths of length two
• Repeated edges in 2-factorizations
• Decomposition of multigraphs
• Decompositions of multigraphs into parts with two edges
• Decompositions into two paths

This page was built for publication: Edge decompositions of multigraphs into multi-2-paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481339)