Premium
Covering genus‐reducing edges by Kuratowski subgraphs
Author(s) -
Brunet Richard,
Richter R. Bruce,
Širáň Jozef
Publication year - 1996
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/(sici)1097-0118(199605)22:1<39::aid-jgt6>3.0.co;2-m
Subject(s) - subdivision , mathematics , combinatorics , torus , graph , genus , enhanced data rates for gsm evolution , discrete mathematics , botany , computer science , geometry , artificial intelligence , geography , biology , archaeology
If G is a graph that minimally does not embed in a nonorientable surface, then each edge of G is in a subdivision of either K 3,3 or K 5 . However, there is an example of a graph that minimally does not embed in the torus and some edge is in no subdivision of either K 3.3 or K 5 . © 1996 John Wiley & Sons, Inc.