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

	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY DocID: 1r79Q - View Document
	The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka DocID: 1r6wl - View Document
	Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma DocID: 1r6iz - View Document
	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS LOCALLY INJECTIVE HOMOMORPHISMS DocID: 1r5we - View Document
	A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar DocID: 1r2yt - View Document