Construction of planar 4-connected triangulations

Gunnar Brinkmann; C. E. Larson; Jasper Souffriau; Nico Van Cleemput

doi:10.26493/1855-3974.459.c4d

ScienceGate Book Chapters

JOURNAL ARTICLE

Construction of planar 4-connected triangulations

Gunnar Brinkmann C. E. Larson Jasper Souffriau Nico Van Cleemput

Year: 2014 Journal: Ars Mathematica Contemporanea Vol: 9 (2)Pages: 145-149 Publisher: Society of Mathematicians, Physicists and Astronomers of Slovenia

DOI: 10.26493/1855-3974.459.c4d

Get Full-Text PDF Get Analytical Report

Abstract

In this article we describe a recursive structure for the class of 4-connected triangulations or – equivalently – cyclically 4-connected plane cubic graphs.

Keywords:

Mathematics Combinatorics Planar Plane (geometry) Class (philosophy) Planar graph Discrete mathematics Geometry Graph Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.04

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

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Construction of planar 4-connected triangulations

Abstract

Metrics

Citation History

Topics

Related Documents

Circumference of essentially 4-connected planar triangulations

Counting 5‐connected planar triangulations

Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators

Largest 4‐connected components of 3‐connected planar triangulations

Construction of acyclically 4-colourable planar triangulations with minimum degree 4