✦ LIBER ✦

A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs

✍ Scribed by Xiaoling Ke

Publisher: Springer
Year: 2011
Tongue: English
Weight: 253 KB
Volume: 50
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-011-9900-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Probabilistic lower bound on the indep

A Probabilistic lower bound on the independence number of graphs

✍ Stanley M. Selkow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.

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 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. (~

Lower bounds on the number of triangles

Lower bounds on the number of triangles in a graph

✍ David C. Fisher 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views