𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique-perfectness of complements of line graphs

✍ Scribed by Flavia Bonomo; Guillermo Durán; Martín D. Safe; Annegret K. Wagler

Book ID
108120819
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
192 KB
Volume
37
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-transversal sets of line graphs a
Clique-transversal sets of line graphs and complements of line graphs
✍ Thomas Andreae; Martin Schughart; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(

A common generalization of line graphs a
A common generalization of line graphs and clique graphs
✍ Erich Prisner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 664 KB

## Abstract Both the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph. We generalize this concept. By a __k__‐edge of a graph we mean a complete subgraph with __k__ vertices or a clique with fewer than __k__ vertices. The __k__‐