|School:||Charles University in Prague|
We are working on some open problems in graph theory and combinatorics. One of the problems concerns routing. We want to find for which graphs there exist switching tables such that it is possible to reach the destination even if (mincut-1) edges are removed. Switching tables, are tables where row i, column j says, where to go from edge i, when previous j-1 recommended edges were missing.
We would like to find out if this problem holds for 3-connected 3-regular graphs.