Plane Geometric Graph Augmentation: A Generic Perspective
From MaRDI portal
Publication:2847914
DOI10.1007/978-1-4614-0110-0_17zbMath1272.05131OpenAlexW2116031575MaRDI QIDQ2847914
Publication date: 25 September 2013
Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_17
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (19)
Plane augmentation of plane graphs to meet parity constraints ⋮ Circumscribing polygons and polygonizations for disjoint line segments ⋮ Disjoint compatibility via graph classes ⋮ Disjoint compatible geometric matchings ⋮ On Hamiltonian alternating cycles and paths ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Compatible spanning trees ⋮ Computing optimal shortcuts for networks ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular augmentation of planar graphs ⋮ Shortcut sets for the locus of plane Euclidean networks ⋮ Augmenting Geometric Graphs with Matchings ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Four-connected triangulations of planar point sets ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) ⋮ Bichromatic compatible matchings
This page was built for publication: Plane Geometric Graph Augmentation: A Generic Perspective