skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Acervo Físico
Or hit Enter to replace search target
Or select another collection:
Search in:
Acervo Físico
Busca Avançada
Busca por Índices
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
Localização:
IME - Inst. Matemática e Estatística
(QA840 L783e )
(Acessar)
This feature requires javascript
Localização & Reservas
Detalhes
Resenhas & Tags
Solicitações
Mais Opções
Prateleira Virtual
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Embeddability in graphs
Autor:
Yanpei Liu 1939
Assuntos:
Graph theory
;
Embeddings (Mathematics)
;
Graph
;
Einbettung (Mathematik)
;
TEORIA DOS GRAFOS
;
Graph theory
Notas:
Includes bibliographical references (p. [352]-387) and index
Descrição:
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
Títulos relacionados:
Série:Mathematics and its applications (Kluwer Academic Publishers)
Editor:
Beijing, China Science Press Dordrecht Boston, Mass Kluwer Academic Publishers
Data de criação/publicação:
c1995
Formato:
xvi, 398 p ill 25 cm..
Idioma:
Inglês
Links
Este item no Dedalus
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
4
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_FISICO)
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript