✦ LIBER ✦

Lower negative decision number in a graph

✍ Scribed by Changping Wang

Book ID: 107619966
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 345 KB
Volume: 34
Category: Article
ISSN: 1598-5865
DOI: 10.1007/s12190-009-0327-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 lower bound for the interval number of

A lower bound for the interval number of a graph

✍ Christoph Maas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Lower bounds on the total domination num

Lower bounds on the total domination number of a graph

✍ Desormeaux, Wyatt J.; Henning, Michael A. 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 269 KB

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