✦ LIBER ✦

On the complexity of testing a graph for n-cube

✍ Scribed by Kabekode V.S. Bhat

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On edge numberings of the n-cube graph

✍ Sergei Bezrukov; Norbert Grünwald; Karl Weber 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 875 KB

The complexity of testing whether a grap

✍ M. Blum; R.M. Karp; O. Vornberger; C.H. Papadimitriu; M. Yannakakis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the complexity of graph reconstructio

✍ Dieter Kratsch; Lane A. Hemaspaandra 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 942 KB

A bound for the complexity of a simple g

✍ Robert Grone; Russell Merris 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by

The Complexity of the Kn,n-Problem for N

✍ Konstantin Skodinis 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 315 KB

On the Complexity of Finding a Sun in a

✍ Hoàng, Chính T. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 192 KB