✦ LIBER ✦

On graphs whose star sets are (co-)cliques

✍ Scribed by S. Akbari; E. Ghorbani; A. Mahmoodi

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 126 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.08.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-transversal number of graphs whos

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

✍ Zuo-song Liang; Er-fang Shan 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 127 KB

Co-cliques and star complements in extre

Co-cliques and star complements in extremal strongly regular graphs

✍ P. Rowlinson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Variations of maximum-clique transversal

Variations of maximum-clique transversal sets on graphs

✍ Chuan-Min Lee 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 882 KB

Generalizations of Grillet's theorem on

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs

✍ Wenan Zang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 639 KB

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

Proof of Ding’s conjecture on maximal st

Proof of Ding’s conjecture on maximal stable sets and maximal cliques in planar graphs

✍ Jing Sun; Zhi-quan Hu 📂 Article 📅 2010 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 185 KB