Incidence coloring

Results: 15



#Item
1Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-07-03 07:48:38
2Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub

Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:55
3

PDF Document

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-05-22 04:06:43
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
5The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a  University of Toronto, Department of Computer Science, 10 King’s College Road,

The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a University of Toronto, Department of Computer Science, 10 King’s College Road,

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-09-09 12:41:59
6(4, 2)-choosability of planar graphs with forbidden structures  1 4

(4, 2)-choosability of planar graphs with forbidden structures 1 4

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2016-07-07 18:45:25
7Lecture 6  Spectral Graph Theory Graphic Inequalities September 18, 2009

Lecture 6 Spectral Graph Theory Graphic Inequalities September 18, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
8Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-03-02 03:52:29
9A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs Mohammed Amin Abdullah∗‡ Nikolaos Fountoulakis†‡

A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs Mohammed Amin Abdullah∗‡ Nikolaos Fountoulakis†‡

Add to Reading List

Source URL: web.mat.bham.ac.uk

Language: English - Date: 2014-12-03 11:53:57
10SIAM 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