3.01[028] k-valent maps on the surfaces

3.02[048] On the linearity of testing planarity of a graph

3.03[068] A new approach to the linearity of testing planarity of graphs

3.04[069] Boolean planarity characterization of graphs

3.05[096] On Boolean characterizations of planarity and planar embeddings of graphs

3.06[138] A polyhedral theory in graphs

3.07[148] Some characterization of the up-embeddability of graphs&Y.Huang

3.08[152] A characterization of the embeddability of graphs on the surface of given genus&Yi.Liu

3.09[153] Bicycles，matchings and trees&K.Berman

3.10[155] Generalized bicycles&K.Berman

专著[141] Embeddability in Graphs

3.11 Preface

3.12 Contents

3.13 Chapter 1 Preliminaries

3.14 Chapter 2 Trees in graphs

3.15 Chapter 3 Spaces in graphs

3.16 Chapter 4 Planar graphs

3.17 Chapter 5 Planarity

3.18 Chapter 6 Gauss crossing problem

3.19 Chapter 7 Planar embeddings

3.20 Chapter 8 Rectilinear embeddability

3.21 Chapter 9 Net embeddability

3.22 Chapter 10 Isomorphisms in polyhedra

3.23 Chapter 11 Decompositions of graphs

3.24 Chapter 12 Surface embeddability

3.25 Chapter 13 Extremal problems

3.26 Chapter 14 Cographic matroids

3.27 Chapter 15 Invariants on knots

3.28 References

3.29 Index