Minimal Schnyder woods and long induced paths in 3-connected planar graphs
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.
Authors
- Christian Ortlieb
Institutions
- University of Rostock (DE)
Publication Details
- Journal
- Discrete Mathematics
- Published
- 2026-11-16
- DOI
- https://doi.org/10.1016/j.disc.2026.115529
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Deutsche Forschungsgemeinschaft