<--- Back to Details
First PageDocument Content
Planar graph / Minor / Forbidden graph characterization / Robertson–Seymour theorem / Petersen graph / Tree decomposition / Tree / Edge contraction / Graph / Graph theory / Graph operations / Graph coloring
Date: 2006-08-23 12:00:09
Planar graph
Minor
Forbidden graph characterization
Robertson–Seymour theorem
Petersen graph
Tree decomposition
Tree
Edge contraction
Graph
Graph theory
Graph operations
Graph coloring

FORBIDDEN MINORS AND MINOR-CLOSED GRAPH PROPERTIES DAN WEINER

Add to Reading List

Source URL: www.math.uchicago.edu

Download Document from Source Website

File Size: 115,09 KB

Share Document on Facebook

Similar Documents

Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† Abstract

DocID: 1vkO7 - View Document

Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

DocID: 1v2rQ - View Document

UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling

DocID: 1uoNh - View Document

The random planar graph process Stefanie Gerke ∗ Dirk Schlatter

DocID: 1tk3p - View Document

Graph theory / Mathematics / Search algorithms / Graph traversal / Breadth-first search / Vertex / NP-complete problems / Graph coloring / Planar graphs / Depth-first search

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document