Edge coloring

Results: 250



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

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

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2018-07-11 06:56:46
2Graph 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.

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2015-10-04 05:22:49
    3Strong Edge Coloring Marleen Kock December 11, 2012 1

    Strong Edge Coloring Marleen Kock December 11, 2012 1

    Add to Reading List

    Source URL: www.math.ru.nl

    - Date: 2016-04-12 05:51:08
      4Distributed (∆ + 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
      5Characterizing 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

      Add to Reading List

      Source URL: rutcor.rutgers.edu

      Language: English - Date: 2012-05-06 07:54:01
      6On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

      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

      Language: English - Date: 2015-07-03 21:55:58
      7Interval 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
      8On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

      On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

      Add to Reading List

      Source URL: kam.mff.cuni.cz

      Language: English - Date: 2009-04-29 03:46:21
      9Concept 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
      10arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

      arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

      Add to Reading List

      Source URL: www.grupolys.org

      Language: English - Date: 2016-05-11 06:39:57