news_import

news_import

Colouring Diamond-free Graphs

2017-03-20 10:00-11:00 FAMNIT-POŠTA Daniel Paulusma (Durham University, England) Colouring Diamond-free Graphs The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices,…

Chiral 4-polytopes in space

2017-02-27 10:00-11:00 FAMNIT-POŠTA Daniel Pellicer (National Autonomous University of Mexico (UNAM)) Chiral 4-polytopes in space In this talk we adopt the notion of skeletal polytope introduce by Grunbaum in the second half of the 20th Century. A polygon is then…

Accessibility Toolbar