Matthias Kriesell

From MaRDI portal
(Redirected from Person:345071)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Rooted minors and locally spanning subgraphs
Journal of Graph Theory
2024-01-24Paper
Contractible edges in longest cycles
Journal of Graph Theory
2023-10-12Paper
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
Journal of Graph Theory
2023-10-05Paper
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
Journal of Graph Theory
2023-10-05Paper
Good acyclic orientations of 4‐regular 4‐connected graphs
Journal of Graph Theory
2023-10-05Paper
A note on uniquely 10‐colorable graphs
Journal of Graph Theory
2023-10-04Paper
Good orientations of unions of edge‐disjoint spanning trees
Journal of Graph Theory
2023-09-29Paper
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
Theoretical Computer Science
2023-09-07Paper
Rainbow bases in matroids2022-06-21Paper
Maximal ambiguously \(k\)-colorable graphs
Journal of Combinatorial Theory. Series B
2020-01-15Paper
Kempe Chains and Rooted Minors2019-11-22Paper
Rooted complete minors in line graphs with a Kempe coloring
Graphs and Combinatorics
2019-05-03Paper
Good orientations of 2T-graphs2019-03-25Paper
Nonseparating <i>K</i><sub>4</sub>‐subdivisions in graphs of minimum degree at least 4
Journal of Graph Theory
2018-10-31Paper
More on foxes
Journal of Graph Theory
2018-10-31Paper
Degree sequences and edge connectivity
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
2018-01-05Paper
In memoriam: Horst Sachs (1927--2016)
Discrete Mathematics
2017-09-05Paper
Unique Colorability and Clique Minors
Journal of Graph Theory
2017-06-30Paper
Antistrong digraphs
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Arc-disjoint directed and undirected cycles in digraphs
Journal of Graph Theory
2016-11-17Paper
Threshold Colorings of Prisms and the Petersen Graph2016-08-08Paper
On minimal graphs containing k perfect matchings2016-08-04Paper
On graphs double-critical with respect to the colouring number
(available as arXiv preprint)
2015-12-03Paper
On graphs double-critical with respect to the colouring number2015-12-03Paper
Vertex-disjoint directed and undirected cycles in general digraphs
Journal of Combinatorial Theory. Series B
2014-08-28Paper
The average degree of minimally contraction-critically 5-connected graphs
Journal of Graph Theory
2014-05-22Paper
Axioms for infinite matroids
Advances in Mathematics
2014-01-08Paper
Disjoint sub(di)graphs in digraphs
Electronic Notes in Discrete Mathematics
2013-10-10Paper
On the problem of finding disjoint cycles and dicycles in a digraph
Combinatorica
2012-04-26Paper
Balancing two spanning trees
Networks
2011-08-16Paper
Minimal Connectivity2011-01-12Paper
Packing Steiner trees on four terminals
Journal of Combinatorial Theory. Series B
2010-11-05Paper
What is on his mind?
Discrete Mathematics
2010-10-18Paper
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
Discrete Mathematics
2010-10-18Paper
Edge disjoint Steiner trees in graphs without large bridges
Journal of Graph Theory
2009-12-18Paper
Disjoint directed and undirected paths and cycles in digraphs
Theoretical Computer Science
2009-11-06Paper
scientific article; zbMATH DE number 5499264 (Why is no real title available?)2009-01-28Paper
On the number of 4-contractible edges in 4-connected graphs
Journal of Combinatorial Theory. Series B
2009-01-21Paper
Vertex suppression in 3-connected graphs
Journal of Graph Theory
2008-11-19Paper
A generating theorem for 5-regular simple planar graphs. I2008-02-20Paper
On the number of contractible triples in 3-connected graphs
Journal of Combinatorial Theory. Series B
2007-12-10Paper
On small contractible subgraphs in 3-connected graphs of small average degree
Graphs and Combinatorics
2007-12-10Paper
There exist highly critically connected graphs of diameter three
Graphs and Combinatorics
2007-05-24Paper
A constructive characterization of 3-connected triangle-free graphs
Journal of Combinatorial Theory. Series B
2007-04-16Paper
How to contract an essentially 6-connected graph to a 5-connected graph
Discrete Mathematics
2007-02-13Paper
Contractions, cycle double covers, and cyclic colorings in locally connected graphs
Journal of Combinatorial Theory. Series B
2007-01-16Paper
Mader's conjecture on extremely critical graphs
Combinatorica
2007-01-08Paper
Closed separator sets
Combinatorica
2007-01-02Paper
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
Combinatorica
2006-06-30Paper
On the pancyclicity of lexicographic products
Graphs and Combinatorics
2006-06-16Paper
Average degree and contractibility
Journal of Graph Theory
2006-05-16Paper
Disjoint A-paths in digraphs
Journal of Combinatorial Theory. Series B
2005-09-28Paper
Triangle Density and Contractibility
Combinatorics, Probability and Computing
2005-04-04Paper
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Discrete Applied Mathematics
2003-10-14Paper
Edge-disjoint trees containing some given vertices in a graph
Journal of Combinatorial Theory. Series B
2003-08-25Paper
A contribution to a conjecture of A. Saito
Graphs and Combinatorics
2003-03-25Paper
All 4-connected line graphs of claw free graphs are Hamiltonian connected
Journal of Combinatorial Theory. Series B
2002-12-10Paper
A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
Journal of Combinatorial Theory. Series B
2002-12-10Paper
Contractible subgraphs in 3-connected graphs
Journal of Combinatorial Theory. Series B
2002-12-10Paper
Almost all 3-connected graphs contain a contractible set of \(k\) vertices
Journal of Combinatorial Theory. Series B
2002-12-10Paper
A survey on contractible edges in graphs of a prescribed vertex connectivity
Graphs and Combinatorics
2002-05-14Paper
Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph
Graphs and Combinatorics
2002-05-14Paper
Induced paths in 5-connected graphs2002-01-08Paper
The symmetric (2k, k)-graphs2002-01-08Paper
On factors of 4-connected claw-free graphs
Journal of Graph Theory
2001-12-16Paper
Edge-dominating trails in AT-free graphs (extended abstract)2001-09-23Paper
Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity2001-09-23Paper
Contractible non-edges in triangle-free graphs
Graphs and Combinatorics
2000-07-05Paper
The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
Journal of Combinatorial Theory. Series B
2000-06-25Paper
Contractible non-edges in \(3\)-connected graphs
Journal of Combinatorial Theory. Series B
2000-06-25Paper
On a conjecture of Thomassen and Toft2000-02-27Paper
scientific article; zbMATH DE number 1194885 (Why is no real title available?)1998-08-30Paper
On k-critical connected line graphs
Journal of Combinatorial Theory. Series B
1998-08-10Paper
scientific article; zbMATH DE number 1089088 (Why is no real title available?)1997-11-18Paper


Research outcomes over time


This page was built for person: Matthias Kriesell