✦ LIBER ✦

On Hamilton Circuits in Tree Graphs

✍ Scribed by Kishi, G.; Kajitani, Y.

Book ID: 111975841
Publisher: Institute of Electrical and Electronics Engineers
Year: 1968
Tongue: English
Weight: 807 KB
Volume: 15
Category: Article
ISSN: 0018-9324
DOI: 10.1109/tct.1968.1082762

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Hamilton Circuits in Tree Grap

A Note on Hamilton Circuits in Tree Graphs

✍ Shank, H. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB

Hamilton circuits in directed-tree graph

Hamilton circuits in directed-tree graphs

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

Hamiltonicity of tree-like graphs

✍ Dragan Marušič 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 426 KB

We investigate hamiltonian properties of a class of graphs whose "factor graphs" are trees. Some results for regular and vertex-transitive graphs are also proved.

Hamilton cycles in circuit graphs of mat

Hamilton cycles in circuit graphs of matroids

✍ Ping Li; Guizhen Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 424 KB

On Hamilton circuits and Hamilton paths

✍ G. A. Dirac 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 828 KB

On decomposition of r-partite graphs int

On decomposition of r-partite graphs into edge-disjoint hamilton circuits

✍ Renu Laskar; Bruce Auerbach 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Let It'Qn; r) denote the complete s-partite graph Kin, n, '.., n). it is shown hzre that for all even n(r -I) 2, Kfn; P) is the union of n(r -'I)/2 of its Hamilton circrlits which are mutually edge-disjoint, and for all odd nfr -1) 3 1, K(n; P) is the union of b(P -f) -r,,rs f l t ii o I s amilton c