"A new planarity criterion for 3-connected graphs."

Alexander K. Kelmans (1981)

> Home

Details and statistics

DOI: 10.1002/JGT.3190050307

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Kelmans81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Kelmans81
Alexander K. Kelmans:
A new planarity criterion for 3-connected graphs. J. Graph Theory 5(3): 259-267 (1981)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.