<--- 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

OPTIMIZING THE GRAPH MINORS WEAK STRUCTURE THEOREM ARCHONTIA C. GIANNOPOULOU† ‡ AND DIMITRIOS M. THILIKOS† § Abstract. One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint

OPTIMIZING THE GRAPH MINORS WEAK STRUCTURE THEOREM ARCHONTIA C. GIANNOPOULOU† ‡ AND DIMITRIOS M. THILIKOS† § Abstract. One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint

DocID: 1t0hk - View Document

Lecture 25  Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Lecture 25 Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

DocID: 1pZpn - View Document

August 4, :42 WSPC - Proceedings Trim Size: 9.75in x 6.5in

August 4, :42 WSPC - Proceedings Trim Size: 9.75in x 6.5in

DocID: 1lkQ9 - View Document

Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

DocID: 18SZ8 - View Document

On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada

On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada

DocID: 18iEc - View Document