✦ LIBER ✦
Dominating sets with small clique covering number
✍ Scribed by Penrice, Stephen G.
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 84 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Motivated by earlier work on dominating cliques, we show that if a graph G is connected and contains no induced subgraph isomorphic to P 6 or H t (the graph obtained by subdividing each edge of K 1,t , t ≥ 3, by exactly one vertex), then G has a dominating set which induces a connected graph with clique covering number at most t -1.