3.01[028] k-valent maps on the surfaces 1005
3.02[048] On the linearity of testing planarity of a graph 1011
3.03[068] A new approach to the linearity of testing planarity of graphs 1021
3.04[069] Boolean planarity characterization of graphs 1030
3.05[096] On Boolean characterizations of planarity and planar embeddings of graphs 1044
3.06[138] A polyhedral theory in graphs 1054
3.07[148] Some characterization of the up-embeddability of graphs&Y.Huang 1061
3.08[152] A characterization of the embeddability of graphs on the surface of given genus&Yi.Liu 1070
3.09[153] Bicycles，matchings and trees&K.Berman 1076
3.10[155] Generalized bicycles&K.Berman 1086
专著[141] Embeddability in Graphs 1100
3.11 Preface 1102
3.12 Contents 1107
3.13 Chapter 1 Preliminaries 1111
3.14 Chapter 2 Trees in graphs 1131
3.15 Chapter 3 Spaces in graphs 1143
3.16 Chapter 4 Planar graphs 1166
3.17 Chapter 5 Planarity 1187
3.18 Chapter 6 Gauss crossing problem 1209
3.19 Chapter 7 Planar embeddings 1227
3.20 Chapter 8 Rectilinear embeddability 1254
3.21 Chapter 9 Net embeddability 1287
3.22 Chapter 10 Isomorphisms in polyhedra 1315
3.23 Chapter 11 Decompositions of graphs 1337
3.24 Chapter 12 Surface embeddability 1365
3.25 Chapter 13 Extremal problems 1394
3.26 Chapter 14 Cographic matroids 1420
3.27 Chapter 15 Invariants on knots 1440
3.28 References 1462
3.29 Index 1498