✦ LIBER ✦

Characterizations of complete directed trees and two-trees

✍ Scribed by Wai-Kai Chen

Book ID: 111964715
Publisher: Institute of Electrical and Electronics Engineers
Year: 1972
Tongue: English
Weight: 806 KB
Volume: 19
Category: Article
ISSN: 0018-9324
DOI: 10.1109/tct.1972.1083457

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computer generation of directed trees an

Computer generation of directed trees and complete trees†

✍ CHEN, WAI-KAI; LI, HEH CHING 📂 Article 📅 1973 🏛 Taylor and Francis Group 🌐 English ⚖ 490 KB

On the Realization of Directed Trees and

On the Realization of Directed Trees and Directed 2-Trees

✍ Wai-Kai Chen 📂 Article 📅 1966 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 425 KB

Iterative procedure for generating trees

Iterative procedure for generating trees and directed trees

✍ Chen, Wai-Kai 📂 Article 📅 1968 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 421 KB

Generation of Directed Trees and 2-Trees

Generation of Directed Trees and 2-Trees Without Duplication

✍ Paul, A., Jr. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 423 KB

Complexes of Directed Trees

✍ Dmitry N. Kozlov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 153 KB

To every directed graph G one can associate a complex 2(G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph G n , where it leads to the study of some interesting representations of the symmetr

Erratum: Iterative procedure for generat

Erratum: Iterative procedure for generating trees and directed trees

✍ Wai-Kai Chen, 📂 Article 📅 1968 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 130 KB