It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially ...
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-...
A complete set of a graph G is a subset of V inducing a complete subgraph. A clique is a maximal complete set. Denote by <![CDATA[${\mathcal{C}}(G)$]]> the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of <
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in