Geometric biplane graphs. II: Graph augmentation

DOI10.1007/s00373-015-1547-0zbMath1312.05037arXiv1702.01277OpenAlexW2081463432MaRDI QIDQ2345512

Rodrigo I. Silveira, Csaba D. Tóth, Maria Saumell, Inês Matos, Matias Korman, F. Javier Tejel, Alfredo Daniel Garcia, Ferran Hurtado

Publication date: 22 May 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.01277

zbMATH Keywords

geometric graphsgraph augmentation\(k\)-connected graphsbiplane graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Linear-size planar Manhattan network for convex point sets, Plane augmentation of plane graphs to meet parity constraints, The Mathematics of Ferran Hurtado: A Brief Survey, Geometric biplane graphs. I: Maximal graphs, Geometric biplane graphs. II: Graph augmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• On triconnected and cubic plane graphs on given point sets
• Augmenting the connectivity of geometric graphs
• The book thickness of a graph
• Applications of a semi-dynamic convex hull algorithm
• On representations of some thickness-two graphs
• On generating planar graphs
• Geometric biplane graphs. I: Maximal graphs
• Geometric biplane graphs. II: Graph augmentation
• Four-connected triangulations of planar point sets
• Triangulating with high connectivity.
• Construction of planar triangulations with minimum degree 5
• Plane Geometric Graph Augmentation: A Generic Perspective
• Constrained Tri-Connected Planar Straight Line Graphs
• Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
• Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
• Augmenting the Connectivity of Planar and Geometric Graphs
• A Theorem on Planar Graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Augmentation Problems
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs