Geometric Biplane Graphs II: Graph Augmentation

We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there ar...

Full description

Saved in:
Bibliographic Details
Published in:Graphs and combinatorics Vol. 31; no. 2; pp. 427 - 452
Main Authors: García, Alfredo, Hurtado, Ferran, Korman, Matias, Matos, Inês, Saumell, Maria, Silveira, Rodrigo I., Tejel, Javier, Tóth, Csaba D.
Format: Journal Article Publication
Language:English
Published: Tokyo Springer Japan 01.03.2015
Springer Nature B.V
Subjects:
ISSN:0911-0119, 1435-5914
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first