Towards a solution of the Holyer's problem

DOI10.1007/3-540-57899-4_48zbMath1530.05181OpenAlexW1518807068MaRDI QIDQ6143972

Zbigniew Lonc

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_48

zbMATH Keywords

\(H\)-decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the decomposition of graphs into isomorphic matchings
• NP-completeness of graph decomposition problems
• On the Complexity of General Graph Factor Problems
• 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

This page was built for publication: Towards a solution of the Holyer's problem