✦ LIBER ✦

The complexity of generalized clique packing

✍ Scribed by D.G. Corneil

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 332 KB
Volume: 12
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90027-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of generalized clique cov

The complexity of generalized clique covering

✍ D.G. Corneil; J. Fonlupt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Clique graphs of packed graphs

✍ Iwao Sato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f

Complexity of clique-coloring odd-hole-f

Complexity of clique-coloring odd-hole-free graphs

✍ David Défossez 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐c

On the Query Complexity of Clique Size a

On the Query Complexity of Clique Size and Maximum Satisfiability

✍ Richard Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 682 KB

This paper explores the bounded query complexity of approximating the size of the maximum clique in a graph (Clique Size) and the number of simultaneously satisfiable clauses in a 3CNF formula (MaxSat). The results in the paper show that for certain approximation factors, approximating Clique Size a

The complexity of generalized graph colo

The complexity of generalized graph colorings

✍ Jason I. Brown 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1004 KB

Complexity of the generalized conjugacy

Complexity of the generalized conjugacy problem

✍ Sang Geun Hahn; Eonkyung Lee; Je Hong Park 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Recently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candidate for cryptographic one-way function. A GCP in a braid group can be transformed into a GCP in a general linear group by the Burau representation. We study the latter problem induced in this way.