A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
NP-Completeness of Some Tree-Clustering Problems
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory Series B
Theoretical Computer Science
Minimum H-decompositions of graphs
Journal of Combinatorial Theory Series B
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
Covering the edges of bipartite graphs using K2,2gaphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Packing 3-vertex paths in claw-free graphs and related topics
Discrete Applied Mathematics
Optimizing regenerator cost in traffic grooming
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Optimizing regenerator cost in traffic grooming
Theoretical Computer Science
The weak 3-flow conjecture and the weak circular flow conjecture
Journal of Combinatorial Theory Series B
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
The k-allocation problem and its variants
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
| Hi-index | 0.00 |
An H-decomposition of a graph G=(V,E) is a partition of E into subgraphs isomorphic to H. Given a fixed graph H, the H-decomposition problem is to determine whether an input graph G admits an H-decomposition.In 1980, Holyer conjectured that H-decomposition is NP-complete whenever H is connected and has three edges or more. Some partial results have been obtained since then. A complete proof of Holyer's conjecture is the content of this paper. The characterization problem of all graphs H for which H-decomposition is NP-complete is hence reduced to graphs where every connected component contains at most two edges.