A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected

• Autorzy: Xiaoyun Lu , Douglas B. West
• Języki publikacji: EN

Abstrakty

EN

We prove a theorem guaranteeing special paths of faces in 2-connected plane graphs. As a corollary, we obtain a new proof of Thomassen’s theorem that every 4-connected planar graph is Hamiltonian-connected.

Słowa kluczowe

EN

4-connected planar graph; Hamiltonian-connected; Tutte-path

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 3
• Strony: 555-564

Daty

wydano

2016-08-01

otrzymano

2015-05-31

poprawiono

2015-09-16

zaakceptowano

2015-09-16

online

2016-07-06

Twórcy

autor

Xiaoyun Lu

• Center for Statistical Research and Methodology Census Bureau, Suitland, MD

autor

Douglas B. West

• Zhejiang Normal University, Jinhua, China and University of Illinois, Urbana, IL

Bibliografia

• [1] C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176. doi:10.1002/jgt.3190070205[Crossref]
• [2] W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116. doi:10.1090/S0002-9947-1956-0081471-8[Crossref]
• [3] H. Whitney, A theorem on graphs, Ann. of Math. 32 (1931) 378-390. doi:10.2307/1968197[Crossref]

Identyfikatory

DOI

10.7151/dmgt.1872