Polytopal Graphs.

Abstract

A graph is d-polytopal provided it is isomorphic to the graph determined by the vertices and edges of a d-dimensional convex polytope. Polytopal graphs are natural objects of study in a variety of problems in pure mathematics (such as the 4-color problem) as well as in applied mathematics (linear programming, coding, etc.). A survey of the most important properties of polytopal graphs is provided, with marginal improvements on some known results. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1973
Accession Number
AD0759732

Entities

People

  • Branko Gruenbaum

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design