<--- Back to Details
First PageDocument Content
Graph coloring / Integer sequences / Enumerative combinatorics / Stirling numbers of the second kind / Chromatic polynomial / Partition / Binomial coefficient / Stirling numbers and exponential generating functions / Mathematics / Graph theory / Combinatorics
Date: 2008-06-25 18:06:10
Graph coloring
Integer sequences
Enumerative combinatorics
Stirling numbers of the second kind
Chromatic polynomial
Partition
Binomial coefficient
Stirling numbers and exponential generating functions
Mathematics
Graph theory
Combinatorics

Add to Reading List

Source URL: www.austinmohr.com

Download Document from Source Website

File Size: 77,37 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Theory of computation / Complexity classes / Graph isomorphism problem / NP / PP / Low / Graph automorphism / Hidden subgroup problem / Time complexity / P / Chromatic polynomial

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

DocID: 1rkqP - View Document

Graph theory / Mathematics / NP-complete problems / Graph coloring / Matching / Bipartite graph / Color-coding / Treewidth / Graph / Cycle / Line graph / Chromatic polynomial

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

DocID: 1r8ab - View Document

Graph theory / Expander graph / Graph coloring / Chromatic polynomial / Two-graph

Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman

DocID: 1qzAO - 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

Graph coloring / NP-complete problems / Recreational mathematics / Sudoku / Logic puzzles / Mathematics of Sudoku / Latin square / Chromatic polynomial / Sudoku Codes / Sudoku solving algorithms

Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T

DocID: 1pziS - View Document