Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub

First Page		Document Content
Date: 2014-08-22 14:44:55 Graph theory Graph coloring Equitable coloring Incidence coloring		Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub Add to Reading List Source URL: orion.math.iastate.edu Download Document from Source Website File Size: 282,14 KB Share Document on Facebook

	Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub DocID: 1qNAx - View Document
	Equitable coloring of random graphs Michael Krivelevich1 , Bal´azs Patk´os2 1 Tel Aviv University, Tel Aviv, Israel 2 Central European University, Budapest, Hungary Phenomena in High Dimensions, Samos 2007 DocID: 1lp7d - View Document
	Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia DocID: 18C3d - View Document
	Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗ DocID: 4J7u - View Document
	The Eighth International Symposium on Operations Research and Its Applications (ISORA’09) Zhangjiajie, China, September 20–22, 2009 Copyright © 2009 ORSC & APORC, pp. 6–14 DocID: 1YMv - View Document