19 citations · 30 across the 14 of their papers we have counts for
20 papers
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
By a well known theorem of Robbins, a graph has a strongly connected orientation if and only if is 2-edge-connected and it is easy to find, in linear time, either a cut edg…
Rainbow bases in matroids
Florian Hörsch, Tomáš Kaiser, Matthias Kriesell
Recently, it was proved by Bérczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically i…
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
J. Bang-Jensen, F. Havet, M. Kriesell +1
Generalizing well-known results of Erdős and Lovász, we show that every graph contains a spanning -partite subgraph with , wher…
Rooted Minors and Locally Spanning Subgraphs
Thomas Böhme, Jochen Harant, Matthias Kriesell +2
Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present…
A note on uniquely 10-colorable graphs
Matthias Kriesell
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
Good acyclic orientations of 4-regular 4-connected graphs
Joergen Bang-Jensen, Matthias Kriesell
We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-grap…