scientific article; zbMATH DE number 398969

zbMath0779.05036MaRDI QIDQ4201584

Michael Tarsi, Miri Priesler

Publication date: 25 August 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decompositionpolynomial-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial ⋮ Edge decompositions and rooted packings of graphs ⋮ Decomposing subcubic graphs into claws, paths or triangles ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ On Rooted Packings, Decompositions, and Factors of Graphs ⋮ Polynomial cases of graph decomposition: A complete solution of Holyer's problem ⋮ On some multigraph decomposition problems and their computational complexity ⋮ Edge decompositions into two kinds of graphs ⋮ Distinct edge geodetic decomposition in graphs

This page was built for publication: