**Current research projects in flows, colorings, tree labelings, structures**

My research is in graph theory and combinatorics. There are close connections between 1-factor – and circuit covers, matchings, flow theory, and graph embeddings. For coloring, my research concentrated on edge colorings and the study of critical graphs and maximum colorable subgraphs. For flows, I focus on circular flows and on balanced valuations on graphs. I am interested in structural properties of cubic graphs with edge-chromatic number 4, in particular in parameters that measure how far a cubic graph is from being 3-edge colorable. Recently, graceful tree labelings raised my interest, too.

There are many hard problems in graph theory which can be solved in the general case if they can be solved for cubic graphs. Examples of such problems are the 4-color-problem (now a theorem), problems concerning cycle- and matching-covers, surface embeddings or flow-problems on graphs. The majority of these problems is easy to solve for 3-edge-colorable cubic graphs. Hence, the class of bridgeless non-3-edge-colorable graphs – so called snarks - is the class of possible counterexamples to many hard conjectures.

One major difficulty in proving theorems for snarks is to find/define appropriate structural parameters for a proof. There are many papers dealing with reductions of snarks to smaller graphs or with invariants that "measure" how far a snark is from being 3-edge-colorable. Many positive results on the aforementioned problems are proved for snarks that satisfy some additional conditions with respect to one of these invariants.

The objective of the proposed research project is to develop a theory of cores for r- graphs. First, we will focus on cubic graphs. The conjectures of Berge-Fulkerson, Fan and Raspaud, the cycle-double-cover conjecture and shortest cycle covers of cubic graphs will be studied. Some of these conjectures can be reformulated in terms of cores. But there are some natural statements on cores which are weaker than these conjectures

**Co-operation project with the Gymnasium Eringerfeld entitled: "Scientific reasoning and proofs"**

14 students of the Gymnasium Eringerfeld would like to be real scientific Mathematicians.

This project introduces the interactive Graph Theory learning software GrinVin (www.grinvin.org) developed by Prof. Dr. Dr. Kris Coolsaed and Dr. Adreaan Peeters of the University of Gent. Based on a finite set of graphs, the software generates theoretical conjectures for the graph(s). The students of the classes 9 to 13 must figure out, whether a conjecture is true (or not). If not, they have to design a counter example. Under the supervision of the Teachers Mustafa Dogan and Ali Ihsan Boz, accompanied by the scientific advisor Eckhard Steffen, the pupils will practice mathematical argumentation. The project’s aim is to expose the students to the concepts of graph theory in an interactive format.