On triconnected and cubic plane graphs on given point sets

DOI10.1016/J.COMGEO.2009.03.005MaRDI QIDQ833718zbMATHOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

cubic graphplane graphgeometric graph3-connected graph

Mathematics Subject Classification ID

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)

Recommendations

• On embedding triconnected cubic graphs on point sets
• Cubic plane graphs on a given point set
• Cubic plane graphs on a given point set
• Constrained tri-connected planar straight line graphs
• scientific article; zbMATH DE number 3963871

Cites work

• scientific article; zbMATH DE number 431516 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• A smallest augmentation to 3-connect a graph
• Augmentation Problems
• Augmenting Outerplanar Graphs
• Augmenting the connectivity of geometric graphs
• Degree constrained tree embedding into points in the plane
• Edge-connectivity augmentation problems
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations
• Independence free graphs and vertex connectivity augmentation
• More on Finite Subsets and Simple Closed Polygonal Paths
• On embedding an outer-planar graph in a point set
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner
• Optimal Algorithms to Embed Trees in a Point Set
• Research Problems in Discrete Geometry
• Straight-line embeddings of two rooted trees in the plane
• Successive edge-connectivity augmentation problems
• The rooted tree embedding problem into points in the plane
• Triangulating with high connectivity.

Cited in

(9)

• Geometric biplane graphs. II: Graph augmentation
• Cubic plane graphs on a given point set
• Cubic plane graphs on a given point set
• Four-connected triangulations of planar point sets
• On embedding triconnected cubic graphs on point sets
• Constrained tri-connected planar straight line graphs
• Augmenting the edge connectivity of planar straight line graphs to three
• Which point sets admit a \(k\)-angulation?
• On collinear sets in straight-line drawings

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)