On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

First Page		Document Content
Date: 2015-07-03 21:55:58 Graph theory Graph coloring List coloring Edge coloring Planar graph Matching Total coloring		On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8 Add to Reading List Source URL: orion.math.iastate.edu Download Document from Source Website File Size: 209,78 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