✦ LIBER ✦

On the complexity of recognizing S-composite and S-prime graphs

✍ Scribed by Hellmuth, Marc

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of recognizing tough g

✍ Douglas Bauer; Aurora Morgana; Edward Schmeichel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 252 KB

On the complexity of recognizing perfect

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 365 KB

On the Complexity of Recognizing Hamming

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

On the complexity of recognizing a class

✍ Chính T. Hoàng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 484 KB

On subgraphs of Cartesian product graphs

✍ Boštjan Breš;ar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 265 KB

On subgraphs of Cartesian product graphs

✍ Boštjan Brešar 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 264 KB