✦ LIBER ✦

Computing the clique number of a-perfect graphs in polynomial time

✍ Scribed by Arnaud Pêcher; Annegret K. Wagler

Book ID: 119236636
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 170 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.10.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the Tutte Polynomial on Graphs

Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width

✍ Giménez, Omer; Hliněný, Petr; Noy, Marc 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 230 KB

A polynomial algorithm for the minimum w

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection

An upper bound on the independence numbe

An upper bound on the independence number of a graph computable in polynomial-time

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB

On the Maximum Number of Cliques in a Gr

On the Maximum Number of Cliques in a Graph

✍ David R. Wood 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 192 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing the clique graph of a line graph

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The maximum number of q-cliques in a gra

The maximum number of q-cliques in a graph with no p-clique

✍ Steven Roman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 805 KB