A polyhedral approach to planar augmentation and related problems

DOI10.1007/3-540-60313-1_166zbMath1517.68304MaRDI QIDQ6102325

Petra Mutzel

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-A700-9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

On the two-connected planar spanning subgraph polytope ⋮ On cutwidth parameterized by vertex cover ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ Graph parameters measuring neighbourhoods in graphs-bounds and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Design of survivable networks
• A minimum 3-connectivity augmentation of a graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Efficient Planarity Testing
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: A polyhedral approach to planar augmentation and related problems