According to our database
1,
Matthias Kriesell
authored at least 67 papers
between 1997 and 2024.
Collaborative distances:
2024
Rooted minors and locally spanning subgraphs.
J. Graph Theory, February, 2024
2023
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations.
Theor. Comput. Sci., September, 2023
Contractible edges in longest cycles.
J. Graph Theory, July, 2023
2022
Good acyclic orientations of 4-regular 4-connected graphs.
J. Graph Theory, 2022
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
J. Graph Theory, 2022
2021
A note on uniquely 10-colorable graphs.
J. Graph Theory, 2021
Good orientations of unions of edge-disjoint spanning trees.
J. Graph Theory, 2021
2020
Maximal ambiguously <i>k</i>-colorable graphs.
J. Comb. Theory, Ser. B, 2020
2019
Rooted Complete Minors in Line Graphs with a Kempe Coloring.
Graphs Comb., 2019
2018
Nonseparating K4-subdivisions in graphs of minimum degree at least 4.
J. Graph Theory, 2018
2017
Unique Colorability and Clique Minors.
J. Graph Theory, 2017
J. Comb. Theory, Ser. B, 2017
2016
Arc-Disjoint Directed and Undirected Cycles in Digraphs.
J. Graph Theory, 2016
2015
On graphs double-critical with respect to the colouring number.
Discret. Math. Theor. Comput. Sci., 2015
2014
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs.
J. Graph Theory, 2014
Vertex-disjoint directed and undirected cycles in general digraphs.
J. Comb. Theory, Ser. B, 2014
2011
Balancing two spanning trees.
Networks, 2011
On the problem of finding disjoint cycles and dicycles in a digraph.
Comb., 2011
2010
Packing Steiner trees on four terminals.
J. Comb. Theory, Ser. B, 2010
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs.
Discret. Math., 2010
2009
Semantic Enhancement of Social Tagging Systems.
Proceedings of the Web 2.0 & Semantic Web, 2009
Disjoint directed and undirected paths and cycles in digraphs.
Theor. Comput. Sci., 2009
Edge disjoint Steiner trees in graphs without large bridges.
J. Graph Theory, 2009
On the number of 4-contractible edges in 4-connected graphs.
J. Comb. Theory, Ser. B, 2009
Disjoint sub(di)graphs in digraphs.
Electron. Notes Discret. Math., 2009
2008
Vertex suppression in 3-connected graphs.
J. Graph Theory, 2008
On the number of contractible triples in 3-connected graphs.
J. Comb. Theory, Ser. B, 2008
On the Effect of Group Structures on Ranking Strategies in Folksonomies.
Proceedings of the Weaving Services and People on the World Wide Web, 2008
2007
A constructive characterization of 3-connected triangle-free graphs.
J. Comb. Theory, Ser. B, 2007
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree.
Graphs Comb., 2007
How to contract an essentially 6-connected graph to a 5-connected graph.
Discret. Math., 2007
2006
Average degree and contractibility.
J. Graph Theory, 2006
Contractions, cycle double covers, and cyclic colorings in locally connected graphs.
J. Comb. Theory, Ser. B, 2006
There Exist Highly Critically Connected Graphs of Diameter Three.
Graphs Comb., 2006
On the Pancyclicity of Lexicographic Products.
Graphs Comb., 2006
Mader's Conjecture On Extremely Critical Graphs.
Comb., 2006
Global Connectivity And Expansion: Long Cycles and Factors In <i>f</i>-Connected Graphs.
Comb., 2006
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
Proceedings of the Semantic Web and Peer-to-Peer, 2006
2005
Disjoint <i>A</i>-paths in digraphs.
J. Comb. Theory, Ser. B, 2005
Triangle Density and Contractibility.
Comb. Probab. Comput., 2005
The Personal Publication Reader.
Proceedings of the Semantic Web - ISWC 2005, 4th International Semantic Web Conference, 2005
Semantic Web Enabled Information Systems: Personalized Views on Web Data.
Proceedings of the Computational Science and Its Applications, 2005
2004
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs.
Proceedings of the Parallel and Distributed Processing and Applications, 2004
2003
Edge-disjoint trees containing some given vertices in a graph.
J. Comb. Theory, Ser. B, 2003
On decomposing a hypergraph into k connected sub-hypergraphs.
Discret. Appl. Math., 2003
2002
A Contribution to a Conjecture of A. Saito.
Graphs Comb., 2002
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.
Graphs Comb., 2002
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity.
Graphs Comb., 2002
2001
Induced paths in 5-connected graphs.
J. Graph Theory, 2001
The symmetric (2<i>k, k</i>)-graphs.
J. Graph Theory, 2001
On factors of 4-connected claw-free graphs.
J. Graph Theory, 2001
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.
J. Comb. Theory, Ser. B, 2001
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph.
J. Comb. Theory, Ser. B, 2001
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices.
J. Comb. Theory, Ser. B, 2001
2000
The <i>k</i>-Critical 2<i>k</i>-Connected Graphs for <i>k</i>epsilon{3, 4}.
J. Comb. Theory, Ser. B, 2000
Contractible Subgraphs in 3-Connected Graphs.
J. Comb. Theory, Ser. B, 2000
1999
On a conjecture of Thomassen and Toft.
J. Graph Theory, 1999
Contractible Non-Edges in Triangle-Free Graphs.
Graphs Comb., 1999
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
Electron. Notes Discret. Math., 1999
Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
Electron. Notes Discret. Math., 1999
1998
Contractible Non-edges in 3-Connected Graphs.
J. Comb. Theory, Ser. B, 1998
On <i>k</i>-Critical Connected Line Graphs.
J. Comb. Theory, Ser. B, 1998
1997
A Note on Hamiltonian Cycles in Lexicographical Products.
J. Autom. Lang. Comb., 1997
