✦ LIBER ✦

Pairs of edge-disjoint Hamiltonian circuits

✍ Scribed by Branko Grünbaum; Joseph Malkevitch

Publisher: Springer
Year: 1975
Tongue: English
Weight: 50 KB
Volume: 13
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01836539

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pairs of edge-disjoint Hamiltonian circu

Pairs of edge-disjoint Hamiltonian circuits

✍ Branko Grünbaum; Joseph Malkevitch 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 242 KB

Pairs of edge disjoint Hamiltonian circu

Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs

✍ Moshe Rosenfeld 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 371 KB

Pairs of edge disjoint Hamiltonian circu

Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs

✍ M. Rosenfeld 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 21 KB

Edge-disjoint Hamiltonian cycles in hype

Edge-disjoint Hamiltonian cycles in hypertournaments

✍ Vojislav Petrovic; Carsten Thomassen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ ≥ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ ≥ k + 1 + 24__d__ vertices (when __k__ ≥ 4) or on __n__ ≥ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Two edge-disjoint hamiltonian cycles in

Two edge-disjoint hamiltonian cycles in graphs

✍ Mingchu Li 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 548 KB

Parallel Algorithm for Shortest Pairs of

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

✍ S. Banerjee; R.K. Ghosh; A.P.K. Reddy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 241 KB

method a solution for MSP can be found within the same time bound. The problem of finding all pairs of shortest paths in a directed graph with nonnegative edge weights can be solved in O(log 2 n) time using n 3 /log n processors on a CREW PRAM [7]. Therefore, SSP can be solved within the same resou