<--- Back to Details
First PageDocument Content
Matroid / Tutte polynomial / Minor / Greedoid / Dual graph / Petersen graph / Chromatic polynomial / Graph / Cubic graph / Graph theory / Mathematics / Matroid theory
Date: 2004-02-09 10:07:29
Matroid
Tutte polynomial
Minor
Greedoid
Dual graph
Petersen graph
Chromatic polynomial
Graph
Cubic graph
Graph theory
Mathematics
Matroid theory

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 181,33 KB

Share Document on Facebook

Similar Documents

Mathematics / Topology / Algebraic topology / Algebra / Matroid theory / Matroid / Simplicial complex / Betti number / Tutte polynomial / Partition matroid / Simplicial set

583 Documenta Math. A Common Recursion For Laplacians of Matroids and Shifted Simplicial Complexes

DocID: 1r60o - View Document

Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Computational problems / Theoretical computer science / Structural complexity theory / Tutte polynomial / NP / Quantum computing / Time complexity / Reduction

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

DocID: 1r1Rx - View Document

Graph theory / Graph coloring / Girth / Graph minor / Tutte polynomial / Coxeter graph / Graph operations / Graph homomorphism / Book:Graph Theory I

Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

DocID: 1q9l5 - View Document

Graph theory / Matroid theory / Polynomials / Tutte polynomial / Adjacency matrix / Treewidth / Tree decomposition / Ear decomposition / Graph coloring / Planar separator theorem

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc

DocID: 1q2CQ - View Document

Mathematics / Computational complexity theory / Graph theory / Polynomials / Complexity classes / Computational problems / Mathematical optimization / Tutte polynomial / Chromatic polynomial / Optimization problem / NP / Matroid

COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

DocID: 1pNcL - View Document