z-logo
Premium
A new planarity criterion for 3‐connected graphs
Author(s) -
Kelmans Alexander K.
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050307
Subject(s) - planarity testing , mathematics , mathematical proof , combinatorics , discrete mathematics , geometry
Direct proofs of some planarity criteria are presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here