<--- Back to Details
First PageDocument Content
List coloring / Planar graph / Neighbourhood / Graph / Edge coloring / Petersen graph / Graph theory / Graph coloring / Total coloring
Date: 2010-05-19 18:28:02
List coloring
Planar graph
Neighbourhood
Graph
Edge coloring
Petersen graph
Graph theory
Graph coloring
Total coloring

Add to Reading List

Source URL: www.fmf.uni-lj.si

Download Document from Source Website

File Size: 102,45 KB

Share Document on Facebook

Similar Documents

Distributed Computing Prof. R. Wattenhofer BA/MA/SA:  Geometric Edge-Coloring

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
 denitions: vertex 
oloring, 
hromati
 number, edge 
oloring, 
hromati
 index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and 
olorings.

Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi de nitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring in nite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings.

DocID: 1upWX - View Document

Strong Edge Coloring Marleen Kock December 11, 2012 1

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,

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

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