✦ LIBER ✦

Reconstructing some bipartite graphs from their spanning trees

✍ Scribed by R.D Boyle

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matchings in bipartite graphs vi

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Topological complexity of graphs and the

✍ R. Nahum; S. Zafrany 📂 Article 📅 1995 🏛 Akadmiai Kiad 🌐 English ⚖ 592 KB

On reconstructing graphs from their sets

✍ Bennet Manvel 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Reconstructing graphs from their k-edge

✍ C.D Godsil; I Krasikov; Y Roditty 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Efficient reconstruction of binary trees

✍ R.D. Cameron; B.K. Bhattacharya; E.A.T. Merks 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 334 KB

On the complexity of reconstructing H-fr

✍ Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini; Jan Arne Te 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB