On 01.12.2005 at 12:20 in S7, there is the following noon lecture:
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.
Modified: 19. 10. 2010