Author:
Harary Frank,Tutte William T.
Abstract
The celebrated criterion of Kuratowski [2] for the planarity of a graph G involves the determination of whether G contains a subgraph homeomorphic to K5 or K3, 3 shown in Figure 1.
Publisher
Canadian Mathematical Society
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph r-hued colorings—A survey;Discrete Applied Mathematics;2022-11
2. A Heuristic for the Coloring of Planar Graphs;Electronic Notes in Theoretical Computer Science;2020-12
3. Basic Graph Theory;Graphs, Networks and Algorithms;2013
4. Triangulated Graphs;A Textbook of Graph Theory;2012
5. Planarity;A Textbook of Graph Theory;2012