✦ LIBER ✦

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

✍ Scribed by Moshe Rosenfeld

Publisher: Springer
Year: 1989
Tongue: English
Weight: 371 KB
Volume: 38
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01839493

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Pairs of Hamiltonian circuits in 5-conne

Pairs of Hamiltonian circuits in 5-connected planar graphs

✍ Joseph Zaks 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 763 KB

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

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

On the extremal number of edges in hamil

On the extremal number of edges in hamiltonian connected graphs

✍ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 421 KB

a b s t r a c t Assume that n and δ are positive integers with 3 ≤ δ < n. Let hc(n, δ) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree δ(G) ≥ δ to be hamiltonian connected.

Any four independent edges of a 4-connec

Any four independent edges of a 4-connected graph are contained in a circuit

✍ Péter L. Erdős; E. Győri 📂 Article 📅 1985 🏛 Akadmiai Kiad 🌐 English ⚖ 197 KB