Wolfgang Mader

Affiliations:
  • University of Hanover, Hannover, Germany


According to our database1, Wolfgang Mader authored at least 32 papers between 1967 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Connectivity keeping trees in <i>k</i>-connected graphs.
J. Graph Theory, 2012

2010
Connectivity keeping paths in <i>k</i>-connected graphs.
J. Graph Theory, 2010

Existence of openly disjoint circuits through a vertex.
J. Graph Theory, 2010

Openly disjoint circuits through a vertex in regular digraphs.
Discret. Math., 2010

2005
High connectivity keeping sets in graphs and digraphs.
Discret. Math., 2005

Graphs With 3<i>n</i>-6 Edges Not Containing A Subdivision Of <i>K</i><sub>5</sub>.
Comb., 2005

2004
High Connectivity Keeping Sets In <i>n</i>-Connected Graphs.
Comb., 2004

2002
On Vertices of outdegree <i>n</i> in minimally <i>n</i>-connected digraphs.
J. Graph Theory, 2002

Circuits through prescribed vertices in <i>k</i>-connected <i>k</i>-regular graphs.
J. Graph Theory, 2002

On <i>k</i>-con-Critically <i>n</i>-Connected Graphs.
J. Comb. Theory, Ser. B, 2002

2001
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.
Comb., 2001

1999
An extremal problem for subdivisions of <i>K</i>.
J. Graph Theory, 1999

1998
3n - 5 Edges Do Force a Subdivision of K<sub>5</sub>.
Comb., 1998

Topological Subgraphs in Graphs of Large Girth.
Comb., 1998

1997
Topological minors in graphs of minimum degree n.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
On topological tournaments of order 4 in digraphs of outdegree 3.
J. Graph Theory, 1996

1995
On Vertices of Degree n in Minimally n-Edge-Connected Graphs.
Comb. Probab. Comput., 1995

Existence of Vertices of Local Connectivity <i>k</i> in Digraphs of Large Outdegree.
Comb., 1995

1994
On Vertex-Edge-Critically n-Connected Graphs.
Comb. Probab. Comput., 1994

1991
Ecken von kleinem Grad in kritisch <i>n</i>-fach zusammenhängenden Digraphen.
J. Comb. Theory, Ser. B, 1991

1989
On critically connected digraphs.
J. Graph Theory, 1989

1988
Über (<i>k</i> + 1)-kritisch (2<i>k</i> + 1)-fach zusammenhängende Graphen.
J. Comb. Theory, Ser. B, 1988

Generalizations of critical connectivity of graphs.
Discret. Math., 1988

1986
Kritisch <i>n</i>-fach kantenzusammenhängende Graphen.
J. Comb. Theory, Ser. B, 1986

1985
Minimal <i>n</i>-fach zusammenhängende Digraphen.
J. Comb. Theory, Ser. B, 1985

Paths in graphs, reducing the edge-connectivity only by two.
Graphs Comb., 1985

Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen.
Eur. J. Comb., 1985

Degree and local connectivity in digraphs.
Comb., 1985

1982
Konstruktion aller n-fach kantenzusammenhängenden Digraphen.
Eur. J. Comb., 1982

1981
On a property of n-edge-connected digraphs.
Comb., 1981

1978
Über n-fach zusammenhängende Eckenmengen in Graphen.
J. Comb. Theory, Ser. B, 1978

1967
Über trennende Eckenmengen in homomorphiekritischen Graphen.
PhD thesis, 1967


  Loading...