𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique-transversal number of graphs whose clique-graphs are trees

✍ Scribed by Zuo-song Liang; Er-fang Shan

Publisher
Chinese Electronic Periodical Services
Year
2008
Tongue
English
Weight
127 KB
Volume
12
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Clique numbers of graphs
Clique numbers of graphs
✍ Paul ErdΓΆs; Marcel ErnΓ© πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 337 KB

For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus

Clique-transversal sets of line graphs a
Clique-transversal sets of line graphs and complements of line graphs
✍ Thomas Andreae; Martin Schughart; Zsolt Tuza πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(