Kuratowski’s Theorem

C. Paul Bonnington and Charles H. C. Little
Additional contact information
C. Paul Bonnington: University of Auckland, Department of Mathematics
Charles H. C. Little: Massey University, Department of Mathematics

Chapter 7 in The Foundations of Topological Graph Theory, 1995, pp 97-109 from Springer

Abstract: Abstract We move on to prove the famous planarity criterion due to Kuratowski, which characterises planar graphs in terms of forbidden subgraphs.

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2540-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461225409

DOI: 10.1007/978-1-4612-2540-9_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().