An extension of the bivariate chromatic polynomial

First Page		Document Content
Date: 2008-12-16 10:45:27 Matroid theory Polynomials Graph coloring Tutte polynomial Chromatic polynomial Matroid Graph property Matching Graph Mathematics Graph theory Theoretical computer science		An extension of the bivariate chromatic polynomial Add to Reading List Source URL: www.cs.technion.ac.il Download Document from Source Website File Size: 362,09 KB Share Document on Facebook

	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
	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
	Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman DocID: 1qzAO - View Document
	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
	Sudoku Squares and Chromatic Polynomials Agnes M. Herzberg and M. Ram Murty T DocID: 1pziS - View Document