𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Brambles and independent packings in chordal graphs

✍ Scribed by Kathie Cameron

Book ID
108114043
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
320 KB
Volume
309
Category
Article
ISSN
0012-365X

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

Chordal graphs and upper irredundance, u
Chordal graphs and upper irredundance, upper domination and independence
✍ Michael S. Jacobson; Ken Peters πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of