✦ LIBER ✦

On computing the minimum 3-path vertex cover and dissociation number of graphs

✍ Scribed by František Kardoš; Ján Katrenič; Ingo Schiermeyer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the -path vertex cover of some graph

✍ Marko Jakovac; Andrej Taranenko 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Computation of minimal rank and path cov

✍ Francesco Barioli; Shaun Fallat; Leslie Hogben 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The vertex (edge) independence number, v

✍ Ying-Ying Tan; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Maximum nullity of outerplanar graphs an

✍ John Sinkovic 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

The Alcuin Number of a Graph and Its Con

✍ Csorba, Péter; Hurkens, Cor A. J.; Woeginger, Gerhard J. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 219 KB

On computing the minimum feedback vertex

✍ Hen-Ming Lin; Jing-Yang Jou 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 294 KB