skip to main content
Guest
e-Shelf
My Account
Sign out
Sign in
This feature requires javascript
Tags
e-Journals
e-Books
Databases
USP Libraries
Help
Help
Language:
English
Spanish
Portuguese (Brazil)
This feature required javascript
This feature requires javascript
Primo Search
General Search
General Search
Physical Collection
Physical Collections
USP Intelectual Production
USP Production
Search For:
Clear Search Box
Search in:
Physical Collection
Or hit Enter to replace search target
Or select another collection:
Search in:
Physical Collection
Advanced Search
Browse Search
This feature requires javascript
This feature requires javascript
Embeddability in graphs
Yanpei Liu 1939
Beijing, China Science Press Dordrecht Boston, Mass Kluwer Academic Publishers c1995
Available at
IME - Inst. Matemática e Estatística
(QA840 L783e )
(GetIt)
This feature requires javascript
Locations & Holds
Details
Reviews & Tags
Requests
More
Virtual Browse
This feature requires javascript
Actions
Add to e-Shelf
Remove from e-Shelf
E-mail
Print
Permalink
Citation
EasyBib
EndNote
RefWorks
Delicious
Export RIS
Export BibTeX
This feature requires javascript
Title:
Embeddability in graphs
Author:
Yanpei Liu 1939
Subjects:
Graph theory
;
Embeddings (Mathematics)
;
Graph
;
Einbettung (Mathematik)
;
TEORIA DOS GRAFOS
;
Graph theory
Notes:
Includes bibliographical references (p. [352]-387) and index
Description:
Ch. 1. Preliminaries -- Ch. 2. Trees in Graphs -- Ch. 3. Spaces in Graphs -- Ch. 4. Planar Graphs -- Ch. 5. Planarity -- Ch. 6. Gauss Crossing Problem -- Ch. 7. Planar Embeddings -- Ch. 8. Rectilinear Embeddability -- Ch. 9. Net Embeddability -- Ch. 10. Isomorphisms in Polyhedra -- Ch. 11. Decompositions of Graphs -- Ch. 12. Surface Embeddability -- Ch. 13. Extremal Problems -- Ch. 14. Graphic and Cographic Matroids -- Ch. 15. Invariants on Knots.
This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable.
At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research
Related Titles:
Series:Mathematics and its applications (Kluwer Academic Publishers)
Publisher:
Beijing, China Science Press Dordrecht Boston, Mass Kluwer Academic Publishers
Creation Date:
c1995
Format:
xvi, 398 p ill 25 cm..
Language:
English
Links
This item in the Library Catalog
This feature requires javascript
This feature requires javascript
Back to results list
This feature requires javascript
This feature requires javascript
Searching Remote Databases, Please Wait
Searching for
in
scope:(USP_FISICO)
Show me what you have so far
This feature requires javascript
This feature requires javascript