A Theorem on Planar Graphs
From MaRDI portal
Publication:5806389
DOI10.1112/jlms/s1-26.4.256zbMath0043.38601OpenAlexW2049411106MaRDI QIDQ5806389
Publication date: 1951
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-26.4.256
Related Items (9)
How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Expansion in SL\(_2(\mathbb R)\) and monotone expanders ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ On the negative cost girth problem in planar networks ⋮ Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Shortest-path queries in static networks ⋮ Unnamed Item ⋮ Short and Simple Cycle Separators in Planar Graphs
This page was built for publication: A Theorem on Planar Graphs
