𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence of subalgebras and partitions

✍ Scribed by D. A. Vladimirov

Publisher
Springer US
Year
1982
Tongue
English
Weight
378 KB
Volume
20
Category
Article
ISSN
1573-8795

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 Vertices of a Tournament in
Partitioning Vertices of a Tournament into Independent Cycles
✍ Guantao Chen; Ronald J. Gould; Hao Li πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 108 KB

Let k be a positive integer. A strong digraph G is termed k-connected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every k-connected tournament with at least 8k vertices contains k vertex-disjoint directed cycle

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