4-connected projective-planar graphs are Hamiltonian-connected

Ken‐ichi Kawarabayashi; Kenta Ozeki

doi:10.1016/j.jctb.2014.11.006

ScienceGate Book Chapters

JOURNAL ARTICLE

4-connected projective-planar graphs are Hamiltonian-connected

Ken‐ichi Kawarabayashi Kenta Ozeki

Year: 2014 Journal: Journal of Combinatorial Theory Series B Vol: 112 Pages: 36-69 Publisher: Elsevier BV

DOI: 10.1016/j.jctb.2014.11.006

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Planar graph Discrete mathematics Connected component Quartic graph Hamiltonian (control theory) Hamiltonian path Graph Graph power Line graph

Metrics

Cited By

0.67

FWCI (Field Weighted Citation Impact)

Refs

0.74

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Computational Geometry and Mesh Generation

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

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

4-connected projective-planar graphs are Hamiltonian-connected

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

Internally 4-connected projective-planar graphs

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