<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Graph coloring / Polytopes / Incidence coloring / Covering graph
Date: 2014-05-22 04:06:43
Graph theory
Mathematics
Graph coloring
Polytopes
Incidence coloring
Covering graph

Add to Reading List

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

Download Document from Source Website

File Size: 93,19 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / Bipartite graphs / Parity / Matching / Vertex cover / Incidence coloring / Minimum-cost flow problem

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

DocID: 1qOZB - View Document

Graph theory / Graph coloring / Equitable coloring / Incidence coloring

Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub

DocID: 1qNAx - View Document

Graph theory / Mathematics / Graph coloring / Polytopes / Incidence coloring / Covering graph

PDF Document

DocID: 1qFaI - View Document

Graph theory / Graph coloring / Planar graph / Triangle-free graph / Nowhere-zero flow / Interval edge coloring / Incidence coloring

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

DocID: 1qClZ - View Document

Graph theory / Graph coloring / List coloring / Edge coloring / Degeneracy / Probabilistic method / Total coloring / Incidence coloring

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,

DocID: 1qyPf - View Document