On triconnected and cubic plane graphs on given point sets
DOI10.1016/J.COMGEO.2009.03.005zbMATH Open1200.05062DBLPjournals/comgeo/GarciaHHTV09OpenAlexW2083702278WikidataQ61732486 ScholiaQ61732486MaRDI QIDQ833718FDOQ833718
Authors: Alfredo García, Ferran Hurtado, Clemens Huemer, Pavel Valtr, Javier Tejel 
Publication date: 14 August 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.03.005
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Augmentation Problems
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding planar graphs at fixed vertex locations
- Straight-line embeddings of two rooted trees in the plane
- On embedding an outer-planar graph in a point set
- Independence free graphs and vertex connectivity augmentation
- A smallest augmentation to 3-connect a graph
- The rooted tree embedding problem into points in the plane
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Edge-connectivity augmentation problems
- One hundred problems in elementary mathematics. With a foreword by Martin Gardner
- Augmenting the connectivity of geometric graphs
- Triangulating with high connectivity.
- Title not available (Why is that?)
- Augmenting Outerplanar Graphs
- Successive edge-connectivity augmentation problems
- Degree constrained tree embedding into points in the plane
- Title not available (Why is that?)
- More on Finite Subsets and Simple Closed Polygonal Paths
Cited In (8)
- Four-connected triangulations of planar point sets
- Cubic plane graphs on a given point set
- Cubic plane graphs on a given point set
- On collinear sets in straight-line drawings
- Geometric biplane graphs. II: Graph augmentation
- Constrained tri-connected planar straight line graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- On embedding triconnected cubic graphs on point sets
This page was built for publication: On triconnected and cubic plane graphs on given point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833718)
