Embeddings of planar graphs that minimize the number of long-face cycles
type: Item
instance of: scholarly article
title: Embeddings of planar graphs that minimize the number of long-face cycles
zbMATH Open document ID: 1010.90090
DOI: 10.1016/S0167-6377(02)00119-0
published in: Operations Research Letters
publication date: 2003-04-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1891049
zbMATH Keywords: graph drawing
zbMATH Keywords: planar graph
zbMATH Keywords: computational complexity
author: Gerhard J. Woeginger
MaRDI profile type: Publication
cites work: Face covers and the genus problem for apex graphs
cites work: Q4263724
cites work: How to Draw a Graph
full work available at URL: s0167-6377(02)00119-0
OpenAlex ID: W2112435812
Recommended article: Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
Recommended article: On the complexity of embedding planar graphs to minimize certain distance measures
Recommended article: Graph Drawing
Recommended article: Planar Embeddings of Graphs with Specified Edge Lengths
Recommended article: On embedding a cycle in a plane graph
Recommended article: Q3484854
Recommended article: Minimal connected enclosures on an embedded planar graph
Recommended article: \(c\)-planarity of embedded cyclic \(c\)-graphs
Recommended article: Embedding cycles of given length in oriented graphs
description: scientific article; zbMATH DE number 1891049