\begin{picture}(30,20) \put(0,0){\circle*{2}} \put(30,0){\circle*{2}} \put(0... ... \put(20,10){\line(-2,1){20}} \bezier{150}(14,12)(15,15)(16,13) \end{picture}


$\textstyle \parbox{7cm}{ {\Huge\bf SEMINARIUM}}$
Matematyka Dyskretna
(prowadzone przez M.Woźniaka)


We wtorek, 8 listopada 2005 roku, o godzinie 12:45
w sali 304, łącznik A-3-A-4, A G H


Martin Kochol
(MÚ SAV, Bratysława (Słowacja))


wygłosi referat pod tytułem:


Applications of superposition


in graph theory


We give survey of several results about nowhere-zero flows in graphs, graph coloring, snarks, complexity of edge coloring and flows, dominating and hamiltonian circuits on graphs. The common feature of these results is a constructive technique in graph theory, called superposition. We also outline some open problems in the area. See also PDF file
 


Serdecznie zapraszamy wszystkich chętnych!