Minimal Schnyder woods and long induced paths in 3-connected planar graphs
Year: 2026
Type: article
Abstract: Schnyder woods proved to be a tool of great benefit for the study of planar graphs. We investigate a new structural property of Schnyder woods: every minimal Schnyder wood of a 3-connected planar graph of order n has a tree of depth at least 1 3 log 2 ( 3 ) log 2 ( n ) . This bound is tight. Our result directly implies that such a graph has an induced path of length at least 1 3 log 2 ( 3 ) log 2 ( n ) , improving the previous best lower bound on the length of such a path.
Source: Discrete Mathematics
Author: Christian Ortlieb
Institution: University of Rostock
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,320
Funder: Deutsche Forschungsgemeinschaft
OpenAlex ID: W7234346848
