Defective coloring

Results: 4



#Item
1Distributed (∆ + 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,

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:55
2Approximately coloring graphs without long induced paths Maria Chudnovsky ∗ Princeton University, Princeton, NJOliver Schaudt Universit¨at zu K¨oln, K¨oln, Germany Sophie Spirkl

Approximately coloring graphs without long induced paths Maria Chudnovsky ∗ Princeton University, Princeton, NJOliver Schaudt Universit¨at zu K¨oln, K¨oln, Germany Sophie Spirkl

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2016-05-24 10:22:54
3Combinatorial Game Theory November 20, Colouring Terminology

Combinatorial Game Theory November 20, Colouring Terminology

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:55
41  Constructing a graph from inter-related objects 1. Add an edge between each pair of sets that don’t intersect. 2. How many neighbours does each vertex of the graph have? Can you explain why? 3. Can you show that the

1 Constructing a graph from inter-related objects 1. Add an edge between each pair of sets that don’t intersect. 2. How many neighbours does each vertex of the graph have? Can you explain why? 3. Can you show that the

Add to Reading List

Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com

Language: English - Date: 2015-03-20 01:33:45