๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On findingk-cliques ink-partite graphs

โœ Scribed by M. Mirghorbani, P. Krokhmal

Book ID
120885540
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
209 KB
Volume
7
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cliques ink-connected graphs
Cliques ink-connected graphs
โœ S. A. Obraztsova ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English โš– 138 KB
Contractible Cliques ink-Connected Graph
Contractible Cliques ink-Connected Graphs
โœ Xiaolong Huang; Zemin Jin; Xingxing Yu; Xiaoyan Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 140 KB
On clique partitions of split graphs
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

Graph partition into small cliques
Graph partition into small cliques
โœ Yan, Jin; Gao, Yunshu; Zhang, Beibei ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 419 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.