Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik

First Page		Document Content
Date: 2013-02-01 23:13:02 Graph coloring NP-complete problems Analysis of algorithms Parameterized complexity List coloring Graph Travelling salesman problem Kernelization Edge coloring Graph theory Theoretical computer science Mathematics		Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik Add to Reading List Source URL: fpt.wdfiles.com Download Document from Source Website File Size: 646,98 KB Share Document on Facebook

	Distributed Computing Prof. R. Wattenhofer BA/MA/SA: Geometric Edge-Coloring DocID: 1xVcm - View Document
	Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi denitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings. DocID: 1upWX - View Document
	Strong Edge Coloring Marleen Kock December 11, 2012 1 DocID: 1sisf - View Document
	Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science, DocID: 1rrEj - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document