𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization and recognition of -sparse graphs partitionable into independent sets and cliques

✍ Scribed by Raquel S.F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti

Book ID
108112905
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
387 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning chordal graphs into indepen
Partitioning chordal graphs into independent sets and cliques
✍ Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider the following generalization of split graphs: A graph is said to be a (k; ')-graph if its vertex set can be partitioned into k independent sets and ' cliques. (Split graphs are obtained by setting k = ' = 1.) Much of the appeal of split graphs is due to the fact that they are chordal, a

Partitions of graphs into one or two ind
Partitions of graphs into one or two independent sets and cliques
✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

Clique polynomials and independent set p
Clique polynomials and independent set polynomials of graphs
✍ Cornelis Hoede; Xueliang Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.