scispace - formally typeset
Search or ask a question

Showing papers on "K-tree published in 1986"


Journal ArticleDOI
TL;DR: The problem of determining whether a graph has a K i -cover ( i ⩾ 2) of cardinality ⩽ k is shown to be NP-complete for graphs in general and polynomial algorithms for solving the separation problem for some classes of facets of the Ki -cover polytope are described.

27 citations


Journal ArticleDOI
TL;DR: These characterizations are used to obtain maximal cliques which have fewer lines (for given k ) than previously known examples.

4 citations


Journal ArticleDOI
TL;DR: This work corrects the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3].

4 citations