Matthias Kriesell

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 17

Top Topics

Connected Graphs

Problems Involving

Top Venues

J. Graph Theory

J. Comb. Theory, Ser. B

Discret. Math. Theor. Comput. Sci.

Publications

Florian Hörsch, Tomás Kaiser, Matthias Kriesell
Rainbow Bases in Matroids. SIAM J. Discret. Math. 38 (2) (2024)
Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
Rooted minors and locally spanning subgraphs. J. Graph Theory 105 (2) (2024)
Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt
Contractible edges in longest cycles. J. Graph Theory 103 (3) (2023)
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973 (2023)
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99 (4) (2022)
Jørgen Bang-Jensen, Matthias Kriesell
Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory 100 (4) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96 (4) (2021)
Matthias Kriesell
A note on uniquely 10-colorable graphs. J. Graph Theory 98 (1) (2021)
Matthias Kriesell
-colorable graphs. J. Comb. Theory, Ser. B 140 (2020)
Matthias Kriesell, Samuel Mohr
Rooted Complete Minors in Line Graphs with a Kempe Coloring. Graphs Comb. 35 (2) (2019)
Matthias Kriesell, Jens M. Schmidt
More on foxes. J. Graph Theory 89 (2) (2018)
Matthias Kriesell
Nonseparating K4-subdivisions in graphs of minimum degree at least 4. J. Graph Theory 89 (2) (2018)
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
Horst Sachs (1927-2016). Discret. Math. 340 (11) (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
Antistrong digraphs. J. Comb. Theory, Ser. B 122 (2017)
Matthias Kriesell
Unique Colorability and Clique Minors. J. Graph Theory 85 (1) (2017)
Matthias Kriesell, Jens M. Schmidt
More on foxes. CoRR (2016)
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory 83 (4) (2016)
Matthias Kriesell, Anders Sune Pedersen
On graphs double-critical with respect to the colouring number. Discret. Math. Theor. Comput. Sci. 17 (2) (2015)
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory, Ser. B 106 (2014)
Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75 (4) (2014)
Matthias Kriesell
Balancing two spanning trees. Networks 57 (4) (2011)
Jørgen Bang-Jensen, Matthias Kriesell
On the problem of finding disjoint cycles and dicycles in a digraph. Comb. 31 (6) (2011)
Matthias Kriesell
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. Discret. Math. 310 (20) (2010)
János Barát, Matthias Kriesell
What is on his mind? Discret. Math. 310 (20) (2010)
Matthias Kriesell
Packing Steiner trees on four terminals. J. Comb. Theory, Ser. B 100 (6) (2010)
Jørgen Bang-Jensen, Matthias Kriesell
Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. 34 (2009)
Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99 (1) (2009)
Jørgen Bang-Jensen, Matthias Kriesell
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410 (47-49) (2009)
Matthias Kriesell
Edge disjoint Steiner trees in graphs without large bridges. J. Graph Theory 62 (2) (2009)
Matthias Kriesell
On the number of contractible triples in 3-connected graphs. J. Comb. Theory, Ser. B 98 (1) (2008)
Matthias Kriesell
Vertex suppression in 3-connected graphs. J. Graph Theory 57 (1) (2008)
Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell
On the Effect of Group Structures on Ranking Strategies in Folksonomies. Weaving Services and People on the World Wide Web (2008)
Matthias Kriesell
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. Graphs Comb. 23 (5) (2007)
Matthias Kriesell
A constructive characterization of 3-connected triangle-free graphs. J. Comb. Theory, Ser. B 97 (3) (2007)
Matthias Kriesell
How to contract an essentially 6-connected graph to a 5-connected graph. Discret. Math. 307 (3-5) (2007)
Tomás Kaiser, Matthias Kriesell
On the Pancyclicity of Lexicographic Products. Graphs Comb. 22 (1) (2006)
Matthias Kriesell
Average degree and contractibility. J. Graph Theory 51 (3) (2006)
Matthias Kriesell
Mader's Conjecture On Extremely Critical Graphs. Comb. 26 (3) (2006)
Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
-Connected Graphs. Comb. 26 (1) (2006)
Matthias Kriesell
Contractions, cycle double covers, and cyclic colorings in locally connected graphs. J. Comb. Theory, Ser. B 96 (6) (2006)
Matthias Kriesell
There Exist Highly Critically Connected Graphs of Diameter Three. Graphs Comb. 22 (4) (2006)
Matthias Kriesell
Closed Separator Sets. Comb. 25 (5) (2005)
Robert Baumgartner, Christian Enzi, Nicola Henze, Marc Herrlich, Marcus Herzog, Matthias Kriesell, Kai Tomaschewski
Semantic Web Enabled Information Systems: Personalized Views on Web Data. ICCSA (2) (2005)
Matthias Kriesell
-paths in digraphs. J. Comb. Theory, Ser. B 95 (1) (2005)
Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski
The Personal Publication Reader. ISWC (2005)
Matthias Kriesell
Triangle Density and Contractibility. Comb. Probab. Comput. 14 (1-2) (2005)
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. ISPA (2004)
Matthias Kriesell
Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser. B 88 (1) (2003)
András Frank, Tamás Király, Matthias Kriesell
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131 (2) (2003)
Matthias Kriesell
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. Graphs Comb. 18 (1) (2002)
Matthias Kriesell
A Contribution to a Conjecture of A. Saito. Graphs Comb. 18 (3) (2002)
Matthias Kriesell
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Graphs Comb. 18 (1) (2002)
Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek
On factors of 4-connected claw-free graphs. J. Graph Theory 37 (2) (2001)
Matthias Kriesell
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. J. Comb. Theory, Ser. B 82 (1) (2001)
Matthias Kriesell
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. J. Comb. Theory, Ser. B 83 (2) (2001)
Matthias Kriesell
Induced paths in 5-connected graphs. J. Graph Theory 36 (1) (2001)
Matthias Kriesell
)-graphs. J. Graph Theory 36 (1) (2001)
Matthias Kriesell
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. J. Comb. Theory, Ser. B 82 (2) (2001)
Matthias Kriesell
epsilon{3, 4}. J. Comb. Theory, Ser. B 78 (1) (2000)
Matthias Kriesell
Contractible Subgraphs in 3-Connected Graphs. J. Comb. Theory, Ser. B 80 (1) (2000)
Matthias Kriesell
Contractible Non-Edges in Triangle-Free Graphs. Graphs Comb. 15 (4) (1999)
Matthias Kriesell
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. Electron. Notes Discret. Math. 3 (1999)
Ekkehard Köhler, Matthias Kriesell
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electron. Notes Discret. Math. 3 (1999)
Matthias Kriesell
On a conjecture of Thomassen and Toft. J. Graph Theory 32 (2) (1999)
Matthias Kriesell
-Critical Connected Line Graphs. J. Comb. Theory, Ser. B 74 (1) (1998)
Matthias Kriesell
Contractible Non-edges in 3-Connected Graphs. J. Comb. Theory, Ser. B 74 (2) (1998)
Matthias Kriesell
A Note on Hamiltonian Cycles in Lexicographical Products. J. Autom. Lang. Comb. 2 (2) (1997)