Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference33 articles.
1. On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs;Barnette,1969
2. Preassigning the shape of a face;Barnette;Pacific J. Math.,1970
3. Kuratowski-Pontrjagin theorem on planar graphs;Burstein;J. Combinatorial Theory Ser. B,1978
4. A theorem of Kuratowski;Dirac;Indag. Math.,1954
Cited by
142 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-09-01
2. Unimodular random one-ended planar graphs are sofic;Combinatorics, Probability and Computing;2023-06-09
3. Macroscopic Network Circulation for Planar Graphs;IEEE Transactions on Control of Network Systems;2022-12
4. Convex Grid Drawings of Plane Graphs with Pentagonal Contours on O(n2) Grids;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021-09-01
5. Chromatic Number, Induced Cycles, and Non-separating Cycles;Graphs and Combinatorics;2020-05-27