✦ LIBER ✦

On the -path vertex cover of some graph products

✍ Scribed by Marko Jakovac; Andrej Taranenko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the minimum 3-path vertex c

✍ František Kardoš; Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Some results on the lexicographic produc

✍ Feng Li; Wei Wang; Zongben Xu; Haixing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 196 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

The crossing numbers of Cartesian produc

✍ Marián Klešč 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Covering a graph by a set of paths origi

✍ I. S. Grunskii; D. V. Speranskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 466 KB

A graph approximation heuristic for the

✍ D.L. Meek; R. Gary Parker 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB