✦ LIBER ✦

A lower bound for the interval number of a graph

✍ Scribed by Christoph Maas

Book ID: 107987738
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 293 KB
Volume: 10
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(84)90070-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB

A lower bound for the CO-irredundance nu

A lower bound for the CO-irredundance number of a graph

✍ S. Finbow 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 215 KB

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A sharp edge bound on the interval numbe

A sharp edge bound on the interval number of a graph

✍ Balogh, J�zsef; Pluh�r, Andr�s 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name

A lower bound for the convexity number o

A lower bound for the convexity number of some graphs

✍ Byung Kee Kim 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 135 KB