<--- Back to Details
First PageDocument Content
Planar graphs / Topological graph theory / Polyhedral combinatorics / Euler characteristic / Water /  gas /  and electricity / Four color theorem / Graph / Graph structure theorem / Planar separator theorem / Graph theory / Mathematics / Graph coloring
Date: 2000-02-02 14:29:27
Planar graphs
Topological graph theory
Polyhedral combinatorics
Euler characteristic
Water
gas
and electricity
Four color theorem
Graph
Graph structure theorem
Planar separator theorem
Graph theory
Mathematics
Graph coloring

On the Euler Characteristic Edward Early Abstract. We discuss the Euler Characteristic and some of the consequences of its topological invariance. We start by following the path of history that motivated the study

Add to Reading List

Source URL: www-math.mit.edu

Download Document from Source Website

File Size: 267,67 KB

Share Document on Facebook

Similar Documents

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

DocID: 1rnTu - View Document

Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE

Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE

DocID: 1riP1 - View Document

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

DocID: 1rcqn - View Document

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

DocID: 1ra7T - View Document

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

DocID: 1r43q - View Document