Matthias Kriesell


Matthias Kriesell
Department of Mathematics
Universität Hamburg
Bundesstraße 55
D-20146 Hamburg




  1. Axioms for infinite matroids, with H. Bruhn, R. Diestel, R. Pendavingh, and P. Wollan, arXiv:1003.3919v2, submitted.

  2. On the problem of finding disjoint cycles and dicycles in a digraph, with J. Bang-Jensen, IMADA Preprint PP-2009-12, submitted.

  3. Large connected dominating matchings in K3-free K2,3-free graphs, IMADA Preprint PP-2009-06, submitted.

  4. Tutte orientability, nowhere zero 3-flows, and claw decompositions of squares and lexicographic products, IMADA Preprint PP-2008-15, submitted.

  5. Orientations with prescribed outdegrees mod 3 of graphs where every edge is on some short cycles, IMADA Preprint PP-2008-14, submitted.

  6. Degree Sequences and Edge Connectivity, Preprint 282 at Hamburger Beiträge zur Mathematik, submitted.

Refereed Publications

  1. What is on his mind?, with J. Barát, to appear in Discrete Mathematics.

  2. On Seymour's strengthening of Hadwiger's Conjecture for graphs with certain forbidden subgraphs, to appear in Discrete Mathematics.

  3. Balancing two spanning trees, to appear in Networks.

  4. Packing Steiner trees on four terminals, to appear in Journal of Combinatorial Theory (B), published online. DOI.

  5. Semantic Enhancement of Social Tagging Systems, with F. Abel, N. Henze, and D. Krause, Annals of Information Systems 6 (2010), 25-54. DOI.

  6. Disjoint directed and undirected paths and cycles in digraphs, with J. Bang-Jensen, Theoretical Computer Science 46-49 (2009), 5138-5144. DOI.

  7. Edge disjoint Steiner trees in graphs without large bridges, Journal of Graph Theory 62 (2009), 188-198. DOI.

  8. Disjoint sub(di)graphs in digraphs, with J. Bang-Jensen, European Conference on Combinatorics, Graph Theory and Applications (2009), Electronic Notes in Discrete Mathematics 34 (2009), 179-183. DOI.

  9. On the number of 4-contractible edges in 4-connected graphs, with K. Ando, Y. Egawa, and K. Kawarabayashi, Journal of Combinatorial Theory (B) 99 (2009), 97-109. DOI.

  10. On the Effect of Group Structures on Ranking Strategies in Folksonomies, with F. Abel, N. Henze, and D. Krause, in: Weaving Services and People on the World Wide Web, Part 2, Springer Berlin Heidelberg (2009), 275-300. DOI.

  11. An elementary proof of Frank's characterization of the graphs having k edge disjoint spanning trees, SUT Journal of Mathematics 44 (2008), 101-107.

  12. On the number of contractible triples in 3-connected graphs, Journal of Combinatorial Theory (B) 98 (2008), 136-145. DOI.

  13. Vertex suppression in 3-connected graphs, Journal of Graph Theory 57 (2008), 41-54. DOI.

  14. On small contractible subgraphs in 3-connected graphs of small average degree, Graphs and Combinatorics 23 (2007), 545-557. DOI.

  15. A constructive characterization of the 3-connected triangle free graphs, Journal of Combinatorial Theory (B) 97 (2007), 358-370. DOI.

  16. How to contract an essentially 6-connected graph to a 5-connected graph, Discrete Mathematics 307 (2007), 494-510. DOI.

  17. A generating theorem for 5-regular simple planar graphs. I., with J. Kanno, Congressus Numerantium 185 (2007), 127-143.

  18. There exist highly critically connected graphs of diameter 3, Graphs and Combinatorics 22 (2006), 481-485. DOI.

  19. Contractions, Cycle Double Covers, and Cyclic Colorings in Locally Connected Graphs, Journal of Combinatorial Theory (B) 96 (2006), 881-900. DOI.

  20. Mader's conjecture on extremely critical graphs, Combinatorica 26 (2006), 277-314. DOI.

  21. On the Pancyclicity of Lexicographic Products, with T. Kaiser, Graphs and Combinatorics 22 (2006), 51-58. DOI.

  22. Average Degree and Contractibility, Journal of Graph Theory 51 (2006), 205-224. DOI.

  23. Global connectivity and expansion: long cycles and factors in f-connected graphs, with S. Brandt, H. Broersma, and R. Diestel, Combinatorica 26 (2006), 17-36. DOI.

  24. Closed Separator Sets, Combinatorica 25 (2005), 575-598. DOI.

  25. A Pictured Memorandum on Synthesis Phenomena Occurring in the Homicidal Chauffeur Game, with M. H. Breitner and A. Meyer, Proceedings of the Fifth International ISDG Workshop, International Society of Dynamic Games, Segovia (2005), 17-32.

  26. The Personal Publication Reader, with F. Abel, R. Baumgartner, A. Brooks, C. Enzi, G. Gottlob, N. Henze, M. Herzog, W. Nejdl, K. Tomaschewski, Semantic Web Challenge, 4th International Semantic Web Conference, Galway (2005).

  27. Disjoint A-paths in Digraphs, Journal of Combinatorial Theory (B) 95 (2005), 168-172. DOI.

  28. Semantic Web enabled Information Systems: Personalized Views on Web Data, with R. Baumgartner, C. Enzi, N. Henze, M. Herrlich, M. Herzog, K. Tomaschewski, International Ubiquitous Web Systems and Intelligence Workshop, Singapore (UWSI 2005). DOI.

  29. Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs, with W. Nejdl and C. Qu, 2nd International Symposium on Parallel and Distributed Processing, Hongkong (ISPA 2004).

    Also contained as a chapter in Semantic Web and Peer-to-Peer, S. Staab und H. Stuckenschmidt (eds.), Springer Heidelberg (2005). DOI.

  30. Triangle Density and Contractibility, Combinatorics, Probability and Computing 14 (2005), 133-146. DOI.

  31. Personalization Functionality for the Semantic Web: Architectural Outline and First Sample Implementations, with N. Henze, 1st International Workshop on Engineering the Adaptive Web (EAW 2004).

  32. On decomposing a hypergraph into k connected sub-hypergraphs, with A. Frank and T. Király, Discrete Applied Mathematics 131 (2003), 373-383. DOI.

  33. Edge disjoint trees containing some given vertices in a graph, Journal of Combinatorial Theory (B) 88 (2003), 53-65. DOI.

  34. A contribution to a conjecture of A. Saito, Graphs and Combinatorics 18 (2002), 565-571. DOI.

  35. A survey on contractible edges in graphs of a given vertex connectivity, Graphs and Combinatorics 18 (2002), 1-30. DOI.

  36. Upper bounds to the number of vertices in a k-critically n-connected graph, Graphs and Combinatorics 18 (2002), 133-146. DOI.

  37. Almost all 3-connected graphs contain a contractible set of k vertices, Journal of Combinatorial Theory (B) 83 (2001), 305-319. DOI.

  38. All 4-connected line graphs of claw free graphs are Hamiltonian connected, Journal of Combinatorial Theory (B) 82 (2001), 306-315. DOI.

  39. On factors of 4-connected claw free graphs, with H. Broersma and Zd. Ryjácek, Journal of Graph Theory 37 (2001), 125-136. DOI.

  40. A degree sum condition for the existence of a contractible edge in a k-connected graph, Journal of Combinatorial Theory (B) 82 (2001), 81-101. DOI.

  41. Induced paths in 5-connected graphs, Journal of Graph Theory 36 (2001), 52-58. DOI.

  42. The symmetric (2k,k)-graphs, Journal of Graph Theory 36 (2001), 35-51. DOI.

  43. Contractible subgraphs in 3-connected graphs, Journal of Combinatorial Theory (B) 80 (2000), 32-48. DOI.

  44. The k-critically 2k-connected graphs for k=3 and k=4, Journal of Combinatorial Theory (B) 78 (2000), 69-80. DOI.

  45. Contractible non-edges in triangle free graphs, Graphs and Combinatorics 15 (1999), 429-439.

  46. On a conjecture of Thomassen and Toft, Journal of Graph Theory 32 (1999), 118-122.

  47. Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity, 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede 1999), Electron. Notes Discrete Math., 3, Elsevier, Amsterdam (1999). DOI.

  48. Edge-dominating trails in AT-free graphs, with E. Köhler, 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede 1999), Electron. Notes Discrete Math., 3, Elsevier, Amsterdam (1999). DOI.

  49. Contractible non-edges in 3-connected graphs, Journal of Combinatorial Theory (B) 74 (1998), 192-201. DOI.

  50. On k-critically connected line graphs, Journal of Combinatorial Theory (B) 74 (1998), 1-7. DOI.

  51. Criticity Results Concerning the Connectivity of Graphs, PhD Thesis, TU Berlin (1997).

  52. A note on Hamiltonian Cycles in Lexicographical Products, Journal of Automata, Languages, and Combinatorics 2 (1997), 135-138.



  1. Linear Algebra I / II (supervision; fall/winter 2009 to summer 2010)

  2. Graph Connectivity Theory, fall/winter 2008

  3. Algebraic Graph Theory, summer 2008

  4. Graph Theory II, summer 2007

  5. Graph Theory I, fall/winter 2006

  6. Matroid Theory, summer 2006

  7. Combinatorial Optimization, summer 2005

  8. Codes & Designs, fall/winter 2004

  9. Algebraic Combinatorics, fall/winter 2003

  10. Matroid Theory, summer 2003

  11. Graph Theory, fall/winter 2002

  12. Combinatorics, fall/winter 2001

  13. The 4-Colour-Problem, fall/winter 2001

  14. Discrete Optimization, summer 2001

June 18th, 2010