M. Kriesell

activity

20102023

most citedAxioms for infinite matroids

19 citations · 30 across the 14 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016

More on foxes

Matthias Kriesell, Jens M. Schmidt

An edge in a $k$ -connected graph $G$ is called {\em $k$ -contractible} if the graph $G / e$ obtained from $G$ by contracting $e$ is $k$ -connected. Generalizing earlier results on $3$ -…

math.CO2016

Threshold Colorings of Prisms and the Petersen Graph

Gasper Fijavz, Matthias Kriesell

Let $G$ be a graph, $r \geq t$ integers, and $N \subseteq E (G)$ . An $(r, t)$ -threshold-coloring of $G$ with respect to $N$ is a mapping $c : V (G) \to {0, \dots, r - 1}$ such t…

math.CO2016

On minimal graphs containing k perfect matchings

Gasper Fijavz, Matthias Kriesell

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision o…

math.CO2016

Antistrong digraphs

Jorgen Bang-Jensen, Stephane Bessy, Bill Jackson +1

An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected t…