The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus
β¦ LIBER β¦
Finding Hamiltonian cycles in certain planar graphs
β Scribed by Robert J. Cimikowski
- Book ID
- 107765892
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 507 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On certain Hamiltonian cycles in planar
β
BοΏ½hme, T.; Harant, J.; TkοΏ½?, M.
π
Article
π
1999
π
John Wiley and Sons
π
English
β 162 KB
π 2 views
Finding large cycles in Hamiltonian grap
β
TomΓ‘s Feder; Rajeev Motwani
π
Article
π
2010
π
Elsevier Science
π
English
β 389 KB
A linear algorithm for finding Hamiltoni
β
Takao Asano; Shunji Kikuchi; Nobuji Saito
π
Article
π
1984
π
Elsevier Science
π
English
β 901 KB
On Hamilton cycles in certain planar gra
β
Sanders, Daniel P.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 586 KB
Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with IS1 5 3, every component of G \ S contains a vertex of XG. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected plan
Finding short cycles in planar graphs us
β
Dana Richards
π
Article
π
1986
π
Elsevier Science
π
English
β 635 KB
Hamiltonian cycles in cubic 3-connected
β
D.A Holton; B Manvel; B.D McKay
π
Article
π
1985
π
Elsevier Science
π
English
β 891 KB