Interval edge coloring

Results: 18



#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
2Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1  ∗

Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2013-09-22 04:19:43
3Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2007-08-09 21:04:38
43-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗

3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:15
5Planar 4-critical graphs with four triangles Oleg V. Borodin ∗ Zdenˇek Dvoˇra´k † Alexandr V. Kostochka Bernard Lidick´ y§

Planar 4-critical graphs with four triangles Oleg V. Borodin ∗ Zdenˇek Dvoˇra´k † Alexandr V. Kostochka Bernard Lidick´ y§

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:59
6Short proofs of coloring theorems on planar graphs Oleg V. Borodin∗ Alexandr V. Kostochka† Bernard Lidick´ y‡

Short proofs of coloring theorems on planar graphs Oleg V. Borodin∗ Alexandr V. Kostochka† Bernard Lidick´ y‡

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:53
7SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:12
8coloring triangle-free planar graphs with a precolored 9-cycle

coloring triangle-free planar graphs with a precolored 9-cycle

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-01-29 17:07:54
93-coloring triangle-free planar graphs with a precolored 9-cycle Ilkyoo Choi, Jan Ekstein, Pˇremysl Holub, Bernard Lidick´y Korea Advanced Institute of Science and Technology, Korea University of West Bohemia, Czech Re

3-coloring triangle-free planar graphs with a precolored 9-cycle Ilkyoo Choi, Jan Ekstein, Pˇremysl Holub, Bernard Lidick´y Korea Advanced Institute of Science and Technology, Korea University of West Bohemia, Czech Re

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-01-31 11:27:16
10Fine structure of 4-critical triangle-free graphs III. General surfaces Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y†

Fine structure of 4-critical triangle-free graphs III. General surfaces Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y†

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-05-27 17:20:44