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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Minimal Schnyder woods and long induced paths in 3-connected planar graphs

Christian Ortlieb
2 links
Discrete Mathematics
Advanced Graph Theory Research
article

Minimal Schnyder woods and long induced paths in 3-connected planar graphs

Christian Ortlieb
article en

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.

Discrete MathematicsVol. 350(3)
University of Rostock (DE)
Deutsche Forschungsgemeinschaft
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon