Wolfgang Mader Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Stein, Oliver Straub, Jessica Ausborn, Wolfgang Mader, Harald Wolf: Motor pattern selection by combinatorial code of interneuronal pathways. Journal of Computational Neuroscience 25(3): 543-561 (2008)
2005
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Graphs With 3n-6 Edges Not Containing A Subdivision Of K5. Combinatorica 25(4): 425-438 (2005)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: High connectivity keeping sets in graphs and digraphs. Discrete Mathematics 302(1-3): 173-187 (2005)
2004
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: High Connectivity Keeping Sets In n-Connected Graphs. Combinatorica 24(3): 441-458 (2004)
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: On k-con-Critically n-Connected Graphs. J. Comb. Theory, Ser. B 86(2): 296-314 (2002)
2001
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. Combinatorica 21(2): 251-265 (2001)
1998
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Topological Subgraphs in Graphs of Large Girth. Combinatorica 18(3): 405-412 (1998)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: 3n - 5 Edges Do Force a Subdivision of K5. Combinatorica 18(4): 569-595 (1998)
1995
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Existence of Vertices of Local Connectivity k in Digraphs of Large Outdegree. Combinatorica 15(4): 533-539 (1995)
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: On Vertices of Degree n in Minimally n-Edge-Connected Graphs. Combinatorics, Probability & Computing 4: 81-95 (1995)
1994
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: On Vertex-Edge-Critically n-Connected Graphs. Combinatorics, Probability & Computing 3: 257-271 (1994)
1991
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen. J. Comb. Theory, Ser. B 53(2): 260-272 (1991)
1988
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. J. Comb. Theory, Ser. B 45(1): 45-57 (1988)
1986
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Kritisch n-fach kantenzusammenhängende Graphen. J. Comb. Theory, Ser. B 40(2): 152-158 (1986)
1985
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Degree and local connectivity in digraphs. Combinatorica 5(2): 161-165 (1985)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: Minimal n-fach zusammenhängende Digraphen. J. Comb. Theory, Ser. B 38(2): 102-117 (1985)
1981
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWolfgang Mader: On a property of n-edge-connected digraphs. Combinatorica 1(4): 385-386 (1981)

Coauthor Index

1Jessica Ausborn [17]
2Wolfgang Stein [17]
3Oliver Straub [17]
4Harald Wolf [17]

Copyright © Tue Dec 1 12:01:14 2009 by Michael Ley (ley@uni-trier.de)