Matthias Kriesell

From MaRDI portal
Revision as of 05:00, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:345071

Available identifiers

zbMath Open kriesell.matthiasMaRDI QIDQ345071

List of research outcomes

PublicationDate of PublicationType
Rooted minors and locally spanning subgraphs2024-01-24Paper
Contractible edges in longest cycles2023-10-12Paper
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties2023-10-05Paper
Good acyclic orientations of 4‐regular 4‐connected graphs2023-10-05Paper
A note on uniquely 10‐colorable graphs2023-10-04Paper
Good orientations of unions of edge‐disjoint spanning trees2023-09-29Paper
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations2023-09-07Paper
Rainbow bases in matroids2022-06-21Paper
Maximal ambiguously \(k\)-colorable graphs2020-01-15Paper
Kempe Chains and Rooted Minors2019-11-22Paper
Rooted complete minors in line graphs with a Kempe coloring2019-05-03Paper
Good orientations of 2T-graphs2019-03-25Paper
More on foxes2018-10-31Paper
Nonseparating K4‐subdivisions in graphs of minimum degree at least 42018-10-31Paper
Degree sequences and edge connectivity2018-01-05Paper
In memoriam: Horst Sachs (1927--2016)2017-09-05Paper
Unique Colorability and Clique Minors2017-06-30Paper
Antistrong digraphs2016-11-25Paper
Arc-Disjoint Directed and Undirected Cycles in Digraphs2016-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 number2015-12-03Paper
Vertex-disjoint directed and undirected cycles in general digraphs2014-08-28Paper
The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs2014-05-22Paper
Axioms for infinite matroids2014-01-08Paper
Disjoint sub(di)graphs in digraphs2013-10-10Paper
On the problem of finding disjoint cycles and dicycles in a digraph2012-04-26Paper
Balancing two spanning trees2011-08-16Paper
Minimal Connectivity2011-01-12Paper
Packing Steiner trees on four terminals2010-11-05Paper
What is on his mind?2010-10-18Paper
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs2010-10-18Paper
Edge disjoint Steiner trees in graphs without large bridges2009-12-18Paper
Disjoint directed and undirected paths and cycles in digraphs2009-11-06Paper
https://portal.mardi4nfdi.de/entity/Q55062652009-01-28Paper
On the number of 4-contractible edges in 4-connected graphs2009-01-21Paper
Vertex suppression in 3-connected graphs2008-11-19Paper
https://portal.mardi4nfdi.de/entity/Q54432512008-02-20Paper
On small contractible subgraphs in 3-connected graphs of small average degree2007-12-10Paper
On the number of contractible triples in 3-connected graphs2007-12-10Paper
There exist highly critically connected graphs of diameter three2007-05-24Paper
A constructive characterization of 3-connected triangle-free graphs2007-04-16Paper
How to contract an essentially 6-connected graph to a 5-connected graph2007-02-13Paper
Contractions, cycle double covers, and cyclic colorings in locally connected graphs2007-01-16Paper
Mader's conjecture on extremely critical graphs2007-01-08Paper
Closed separator sets2007-01-02Paper
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs2006-06-30Paper
On the pancyclicity of lexicographic products2006-06-16Paper
Average degree and contractibility2006-05-16Paper
Disjoint \(A\)-paths in digraphs2005-09-28Paper
Triangle Density and Contractibility2005-04-04Paper
On decomposing a hypergraph into \(k\) connected sub-hypergraphs2003-10-14Paper
Edge-disjoint trees containing some given vertices in a graph2003-08-25Paper
A contribution to a conjecture of A. Saito2003-03-25Paper
Contractible subgraphs in 3-connected graphs2002-12-10Paper
A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph2002-12-10Paper
All 4-connected line graphs of claw free graphs are Hamiltonian connected2002-12-10Paper
Almost all 3-connected graphs contain a contractible set of \(k\) vertices2002-12-10Paper
A survey on contractible edges in graphs of a prescribed vertex connectivity2002-05-14Paper
Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph2002-05-14Paper
The symmetric (2k, k)-graphs2002-01-08Paper
Induced paths in 5-connected graphs2002-01-08Paper
On factors of 4-connected claw-free graphs2001-12-16Paper
https://portal.mardi4nfdi.de/entity/Q27413462001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27413492001-09-23Paper
Contractible non-edges in triangle-free graphs2000-07-05Paper
Contractible non-edges in \(3\)-connected graphs2000-06-25Paper
The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)2000-06-25Paper
On a conjecture of Thomassen and Toft2000-02-27Paper
https://portal.mardi4nfdi.de/entity/Q38432471998-08-30Paper
On \(k\)-critical connected line graphs1998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43658231997-11-18Paper
Rainbow bases in matroids0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Matthias Kriesell