✦ LIBER ✦

Graph partition into small cliques

✍ Scribed by Yan, Jin; Gao, Yunshu; Zhang, Beibei

Book ID: 122808465
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 419 KB
Volume: 162
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.09.003

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

Partitioning extended -laden graphs into

Partitioning extended -laden graphs into cliques and stable sets

✍ Raquel S.F. Bravo; Sulamita Klein; Loana T. Nogueira; Fábio Protti; Rudini M. Sa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Clique and anticlique partitions of grap

Clique and anticlique partitions of graphs

✍ Krzysztof Bryś; Zbigniew Lonc 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 408 KB

In the paper we prove that, for a fixed k, the problem of deciding whether a graph admits a partition of its vertex set into k-element cliques or anticliques (i.e. independent sets) is polynomial.

On clique partitions of split graphs

✍ W.D. Wallis; J. Wu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

On findingk-cliques ink-partite graphs

✍ M. Mirghorbani, P. Krokhmal 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 209 KB

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