Geometric biplane graphs. I: Maximal graphs
From MaRDI portal
Publication:2345511
DOI10.1007/s00373-015-1546-1zbMath1311.05040arXiv1702.01275OpenAlexW1987580358MaRDI QIDQ2345511
Maria Saumell, Inês Matos, Csaba D. Tóth, Rodrigo I. Silveira, Matias Korman, Ferran Hurtado, Alfredo Daniel Garcia, F. Javier Tejel
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.01275
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items (4)
The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Note on \(k\)-planar crossing numbers ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation
Cites Work
- Unnamed Item
- Unnamed Item
- Counting triangulations of planar point sets
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
- The boundary and the shape of binary images
- Augmenting the connectivity of geometric graphs
- Generalized Delaunay triangulation for planar graphs
- Biplanar graphs: A survey
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- On representations of some thickness-two graphs
- On generating planar graphs
- Geometric biplane graphs. I: Maximal graphs
- Geometric biplane graphs. II: Graph augmentation
- Counting Plane Graphs: Flippability and Its Applications
- Plane Geometric Graph Augmentation: A Generic Perspective
- Constrained Tri-Connected Planar Straight Line Graphs
- Fáry’s Theorem for 1-Planar Graphs
- Asymptotic enumeration and limit laws of planar graphs
- Augmenting the Connectivity of Planar and Geometric Graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Crossing-Free Subgraphs
- Geometric Thickness of Complete Graphs
- Testing bipartiteness of geometric intersection graphs
This page was built for publication: Geometric biplane graphs. I: Maximal graphs