Über trennende Eckenmengen in homomorphiekritischen Graphen. - Wolfgang Mader 001 (1967)

Über n-fach zusammenhängende Eckenmengen in Graphen. - Wolfgang Mader 001 (J. Comb. Theory B, 1978)

On a property of n-edge-connected digraphs. - Wolfgang Mader 001 (Comb., 1981)

Konstruktion aller n-fach kantenzusammenhängenden Digraphen. - Wolfgang Mader 001 (Eur. J. Comb., 1982)

Degree and local connectivity in digraphs. - Wolfgang Mader 001 (Comb., 1985)

Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen. - Wolfgang Mader 001 (Eur. J. Comb., 1985)

Paths in graphs, reducing the edge-connectivity only by two. - Wolfgang Mader 001 (Graphs Comb., 1985)

Minimal n-fach zusammenhängende Digraphen. - Wolfgang Mader 001 (J. Comb. Theory B, 1985)

Kritisch n-fach kantenzusammenhängende Graphen. - Wolfgang Mader 001 (J. Comb. Theory B, 1986)

Generalizations of critical connectivity of graphs. - Wolfgang Mader 001 (Discret. Math., 1988)

Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. - Wolfgang Mader 001 (J. Comb. Theory B, 1988)

On critically connected digraphs. - Wolfgang Mader 001 (J. Graph Theory, 1989)

Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen. - Wolfgang Mader 001 (J. Comb. Theory B, 1991)

On Vertex-Edge-Critically n-Connected Graphs. - Wolfgang Mader 001 (Comb. Probab. Comput., 1994)

Existence of Vertices of Local Connectivity k in Digraphs of Large Outdegree. - Wolfgang Mader 001 (Comb., 1995)

On Vertices of Degree n in Minimally n-Edge-Connected Graphs. - Wolfgang Mader 001 (Comb. Probab. Comput., 1995)

On topological tournaments of order 4 in digraphs of outdegree 3. - Wolfgang Mader 001 (J. Graph Theory, 1996)

Topological minors in graphs of minimum degree n. - Wolfgang Mader 001 (Contemporary Trends in Discrete Mathematics, 1997)

Topological Subgraphs in Graphs of Large Girth. - Wolfgang Mader 001 (Comb., 1998)

3n - 5 Edges Do Force a Subdivision of K5. - Wolfgang Mader 001 (Comb., 1998)

An extremal problem for subdivisions of K. - Wolfgang Mader 001 (J. Graph Theory, 1999)

Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n epsilon and Large Girth. - Wolfgang Mader 001 (Comb., 2001)

On k-con-Critically n-Connected Graphs. - Wolfgang Mader 001 (J. Comb. Theory B, 2002)

Circuits through prescribed vertices in k-connected k-regular graphs. - Roland Häggkvist; Wolfgang Mader 001 (J. Graph Theory, 2002)

On Vertices of outdegree n in minimally n-connected digraphs. - Wolfgang Mader 001 (J. Graph Theory, 2002)

High Connectivity Keeping Sets In n-Connected Graphs. - Wolfgang Mader 001 (Comb., 2004)

Graphs With 3n-6 Edges Not Containing A Subdivision Of K5. - Wolfgang Mader 001 (Comb., 2005)

High connectivity keeping sets in graphs and digraphs. - Wolfgang Mader 001 (Discret. Math., 2005)

Openly disjoint circuits through a vertex in regular digraphs. - Wolfgang Mader 001 (Discret. Math., 2010)

Existence of openly disjoint circuits through a vertex. - Wolfgang Mader 001 (J. Graph Theory, 2010)

Connectivity keeping paths in k-connected graphs. - Wolfgang Mader 001 (J. Graph Theory, 2010)

Connectivity keeping trees in k-connected graphs. - Wolfgang Mader 001 (J. Graph Theory, 2012)