Sorry, this item is currently unavailable.

Polyhedral Graphs

ISBN: 9781584888451 | 1584888458
Edition: 1st
Format: Hardcover
Publisher: Chapman & Hall/
Pub. Date: 2/25/2013

Why Rent from Knetbooks?

Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!

Top 5 reasons to order all your textbooks from Knetbooks:

  • We have the lowest prices on thousands of popular textbooks
  • Free shipping both ways on ALL orders
  • Most orders ship within 48 hours
  • Need your book longer than expected? Extending your rental is simple
  • Our customer support team is always here to help
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 both well-known and new findings on polyhedral graphs. Each chapter provides open problems and addresses an essential topic in the field. These topics include face and edge types, light edges and paths, connected subgraphs with restricted degrees of vertices, spanning subgraphs, cycles in polyhedral graphs, face-vectors and vertex-vectors of complex polyhedra, groups of symmetries, duality in polyhedra, and the coloring of polyhedral graphs.

Please wait while this item is added to your cart...