Choosability of P5-free graphs∗ Petr A. Golovach†

First Page		Document Content
Date: 2009-05-31 05:49:27 Graph operations List coloring Dominating set Cograph Graph Bipartite graph Degeneracy Graph homomorphism Graph theory Graph coloring NP-complete problems		Choosability of P5-free graphs∗ Petr A. Golovach† Add to Reading List Source URL: www.ii.uib.no Download Document from Source Website File Size: 155,48 KB Share Document on Facebook

	HERA Memo 24 March 23, 2017 Omnical Degeneracy Removal Josh Dillon and Aaron Parsons 1 DocID: 1uFgW - View Document
	Enumeration of All Extreme Equilibria of Bimatrix Games with Integer Pivoting and Improved Degeneracy Check∗ Gabriel D. Rosenberg Department of Mathematics, London School of Economics and Political Science Houghton St, DocID: 1tUue - View Document
	Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA { DocID: 1revt - View Document
	An In-Depth Study of Stochastic Kronecker Graphs C.Seshadhri, Ali Pinar, and Tamara Kolda Sandia National Laboratories Abstract—Graph analysis is playing an increasingly important role in science and industry. Due to n DocID: 1qM1h - View Document
	The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a University of Toronto, Department of Computer Science, 10 King’s College Road, DocID: 1qyPf - View Document