✦ LIBER ✦

Circular-arc graphs with clique cover number two

✍ Scribed by Jeremy Spinrad

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 325 KB
Volume: 44
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90038-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On clique covers and independence number

On clique covers and independence numbers of graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Dense graphs with small clique number

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

Fractional chromatic number and circular

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__

Two remarks on circular arc graphs

✍ Pavol Hell; Jing Huang 📂 Article 📅 1997 🏛 Springer Japan 🌐 English ⚖ 461 KB

Well covered simplicial, chordal, and ci

Well covered simplicial, chordal, and circular arc graphs

✍ Prisner, Erich; Topp, Jerzy; Vestergaard, Preben Dahl 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we,characterize well covered simplicial, chordal and circular arc graphs.

On antichain intersection numbers, total

On antichain intersection numbers, total clique covers and regular graphs

✍ Morimasa Tsuchiya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n