scientific article
From MaRDI portal
Publication:3455031
zbMath1327.05270MaRDI QIDQ3455031
David J. Mendell, Justine E. Dion, Ajit A. Diwan, Shailesh K. Tipnis, Michael J. Plantholt
Publication date: 3 December 2015
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2692/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Decomposing subcubic graphs into claws, paths or triangles ⋮ Pack graphs with subgraphs of size three ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number
This page was built for publication:
