✦ LIBER ✦

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

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

Book ID: 122265068
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 429 KB
Volume: 35
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the clique number of a-perfect

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

✍ Arnaud Pêcher; Annegret K. Wagler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Computing clique and chromatic number of

Computing clique and chromatic number of circular-perfect graphs in polynomial time

✍ Pêcher, Arnaud; Wagler, Annegret K. 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 196 KB

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

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

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

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