Polyhedral Graphs
Seiten
2009
Chapman & Hall/CRC (Verlag)
978-1-58488-845-1 (ISBN)
Chapman & Hall/CRC (Verlag)
978-1-58488-845-1 (ISBN)
- Keine Verlagsinformationen verfügbar
- Artikel merken
The study of the combinatorial properties of convex polyhedra is equivalent to the study of the properties of graphs determined by vertices and edges of convex three-dimensional polytopes. This book presents a review of findings on polyhedral graphs. It includes chapters that provide open problems and addresses essential topics in the field.
Pavol Jozef Safarik University, Kosice, Slovak Republic Technical University of Ilmenau, Pennewitz, Germany Pavol Jozef University, Kosice, Slovak Republic University of Central Florida, Orlando, USA Rutgers University, Piscataway, New Jersey, USA
Introduction. Numbers of Vertices, Edges, and Faces of Polyhedral Graphs. Faces Types and Edge Types. Light Edges. Light Paths. Connected Subgraphs with Restricted Degrees of Their Vertices. Spanning Subgraphs. Cycles in Polyhedral Graphs. Face-Vectors and Vertex-Vectors of Convex Polyhedra. Groups of Symmetries of Convex Polyhedra. Duality in Polyhedra. Colouring of Polyhedral Graphs.
Erscheint lt. Verlag | 25.2.2009 |
---|---|
Reihe/Serie | Pure and Applied Mathematics |
Mitarbeit |
Herausgeber (Serie): Earl Taft |
Sprache | englisch |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
ISBN-10 | 1-58488-845-8 / 1584888458 |
ISBN-13 | 978-1-58488-845-1 / 9781584888451 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95