z-logo
open-access-imgOpen Access
A characterization of almost all minimal not nearly planar graphs
Author(s) -
Kwang Ju Choi
Publication year - 2013
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.31390/gradschool_dissertations.2011
Subject(s) - planar graph , planar , combinatorics , outerplanar graph , mathematics , pathwidth , chordal graph , 1 planar graph , graph , discrete mathematics , enhanced data rates for gsm evolution , computer science , line graph , artificial intelligence , computer graphics (images)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom