Structural parameters of Schnyder woods

DOI10.1016/j.disc.2024.114282MaRDI QIDQ6646404

Christian Ortlieb, Jens M. Schmidt

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

3-connected planar graphleafsingletonSchnyder woodordered path partition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• How to draw a planar graph on a grid
• Optimal \(st\)-orientations for plane triangulations
• Output-sensitive reporting of disjoint paths
• Lattice structures from planar graphs
• Drawing planar graphs using the canonical ordering
• Drawing planar graphs with few segments on a polynomial grid
• More Canonical Ordering
• Contact Representations of Graphs in 3D
• Straight-Line Drawing of Quadrangulations
• Algorithms and Data Structures
• Convex drawings of planar graphs and the order dimension of 3-polytopes

This page was built for publication: Structural parameters of Schnyder woods