✦ LIBER ✦

Generalized vertex covering in interval graphs

✍ Scribed by Madhav V. Marathe; R. Ravi; C. Pandu Rangan

Book ID: 104184272
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 628 KB
Volume: 39
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90116-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-symmetric generalized Moore graph

Vertex-symmetric generalized Moore graphs

✍ Michael Sampels 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The transmission of a connected graph G is deÿned as the sum of all distances in G. A lower bound for the transmission, which can be regarded as a generalization of the Moore bound, was derived by Cerf et al. Graphs with a transmission attaining this bound are called generalized Moore graphs. Using

Connected vertex covers in dense graphs

✍ Jean Cardinal; Eythan Levy 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Vertex Covers and Secure Domination in G

Vertex Covers and Secure Domination in Graphs

✍ Burger, Alewyn; Henning, Michael; van Vuuren, Jan 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 171 KB

Computer generation of vertex graphs

✍ N.S. Sridharan 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Vertex cover in graphs with locally few

Vertex cover in graphs with locally few colors

✍ Fabian Kuhn; Monaldo Mastrolilli 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 269 KB

The vertex-cover polynomial of a graph

✍ F.M. Dong; M.D. Hendy; K.L. Teo; C.H.C. Little 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB