Open Access · CC BY-NC-ND 4.0
Minimal Schnyder woods and long induced paths in 3-connected planar graphs
Discrete Mathematics · 2027-03 · 350 (3) · 115529
DOI: 10.1016/j.disc.2026.115529 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2027-03. Verfasst von Christian Ortlieb. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: German Research Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- German Research Foundation
Zitieren
APA
Ortlieb, C. (2027). Minimal Schnyder woods and long induced paths in 3-connected planar graphs. Discrete Mathematics, 350(3), 115529. https://doi.org/10.1016/j.disc.2026.115529
Vancouver
Ortlieb C. Minimal Schnyder woods and long induced paths in 3-connected planar graphs. Discrete Mathematics. 2027;350(3):115529. doi:10.1016/j.disc.2026.115529
BibTeX
@article{Ortlieb2027,
author = {Ortlieb, Christian},
title = {Minimal Schnyder woods and long induced paths in 3-connected planar graphs},
journal = {Discrete Mathematics},
year = {2027},
volume = {350},
number = {3},
pages = {115529},
doi = {10.1016/j.disc.2026.115529}
}
EUVIMED