On some multigraph decomposition problems and their computational complexity
From MaRDI portal
Publication:1827716
DOI10.1016/j.disc.2003.07.005zbMath1076.68049MaRDI QIDQ1827716
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.07.005
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- A note on the decomposition of graphs into isomorphic matchings
- NP-completeness of graph decomposition problems
- Edge-disjoint packings of graphs
- 3K2-decomposition of a graph
- The NP-Completeness of Some Edge-Partition Problems
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Unnamed Item
- Unnamed Item