Premium
Planar graphs producing no strongly almost trivial embedding
Author(s) -
Huh Youngsik,
Oh Seungsang
Publication year - 2003
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.10123
Subject(s) - planar graph , mathematics , combinatorics , embedding , book embedding , planar , planar straight line graph , 1 planar graph , graph , discrete mathematics , outerplanar graph , pathwidth , chordal graph , line graph , computer science , computer graphics (images) , artificial intelligence
We present here infinitely many planar graphs which have no strongly almost trivial embeddings. Then we conclude that “ strongly almost trivial ” is more strict concept than “ almost trivial. ”. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 319–326, 2003
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom