4 citations · 9 across the 4 of their papers we have counts for
4 papers
On graphs double-critical with respect to the colouring number
Matthias Kriesell, Anders Sune Pedersen
The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified or…
Vertex-disjoint directed and undirected cycles in general digraphs
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni +1
The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the followin…
Nonseparating K4-subdivisions in graphs of minimum degree at least 4
Matthias Kriesell
We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H…
Minimal Connectivity
Matthias Kriesell
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contract…