A new proof that 4-connected planar graphs are Hamiltonian-connected

Xiaoyun Lu; Douglas B. West

doi:10.7151/dmgt.1872

ScienceGate Book Chapters

JOURNAL ARTICLE

A new proof that 4-connected planar graphs are Hamiltonian-connected

Xiaoyun Lu Douglas B. West

Year: 2016 Journal: Discussiones Mathematicae Graph Theory Vol: 36 (3)Pages: 555-555 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.1872

Get Full-Text PDF Get Analytical Report

Abstract

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.

Keywords:

Mathematics Combinatorics Planar graph Planar Hamiltonian (control theory) Discrete mathematics Hamiltonian path Graph Computer science

Metrics

Cited By

0.74

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Materials and Mechanics

Physical Sciences → Engineering → Mechanical Engineering

A new proof that 4-connected planar graphs are Hamiltonian-connected

Abstract

Metrics

Citation History

Topics

Related Documents

4-connected projective-planar graphs are Hamiltonian-connected

4-connected projective-planar graphs are hamiltonian-connected

4-connected projective-planar graphs are hamiltonian-connected

4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected

4-Connected Projective-Planar Graphs Are Hamiltonian