Re-embedding structures of 4-connected projective-planar graphs

Yusuke Suzuki

doi:10.1002/jgt.20553

ScienceGate Book Chapters

JOURNAL ARTICLE

Re-embedding structures of 4-connected projective-planar graphs

Yusuke Suzuki

Year: 2010 Journal: Journal of Graph Theory Vol: 68 (3)Pages: 213-228 Publisher: Wiley

DOI: 10.1002/jgt.20553

Get Full-Text PDF Get Analytical Report

Abstract

We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n. © 2010 Wiley Periodicals, Inc. J Graph Theory 68: 213-228, 2011

Keywords:

Combinatorics Mathematics Projective plane Embedding Planar graph Projective test Book embedding Discrete mathematics Planar Graph 1-planar graph Chordal graph Pure mathematics Computer science Geometry

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.09

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

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Re-embedding structures of 4-connected projective-planar graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Re-embedding structures of 5-connected projective-planar graphs

Re-embedding of projective-planar graphs

Internally 4-connected projective-planar graphs

4-connected projective-planar graphs are Hamiltonian-connected

4-connected projective-planar graphs are hamiltonian-connected