Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Christian Ortlieb (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: