Old Web
English
Sign In
Acemap
>
Paper
>
A characterization of almost all minimal not nearly planar graphs
A characterization of almost all minimal not nearly planar graphs
2013
Kwang Ju Choi
Keywords:
Combinatorics
Universal graph
1-planar graph
Nowhere-zero flow
Forbidden graph characterization
Polyhedral graph
Planar straight-line graph
Robertson–Seymour theorem
Pathwidth
Topology
Mathematics
Discrete mathematics
Outerplanar graph
Book embedding
Correction
Source
Cite
Save
Machine Reading By IdeaReader
17
References
0
Citations
NaN
KQI
[]