The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wolfgang Mader: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang Mader
    Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:251-265 [Journal]
  2. Wolfgang Mader
    High Connectivity Keeping Sets In n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:441-458 [Journal]
  3. Wolfgang Mader
    Graphs With 3n-6 Edges Not Containing A Subdivision Of K5. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:4, pp:425-438 [Journal]
  4. Wolfgang Mader
    On a property of n-edge-connected digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:385-386 [Journal]
  5. Wolfgang Mader
    Degree and local connectivity in digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:2, pp:161-165 [Journal]
  6. Wolfgang Mader
    Existence of Vertices of Local Connectivity k in Digraphs of Large Outdegree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:533-539 [Journal]
  7. Wolfgang Mader
    Topological Subgraphs in Graphs of Large Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:3, pp:405-412 [Journal]
  8. Wolfgang Mader
    3n - 5 Edges Do Force a Subdivision of K5. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:569-595 [Journal]
  9. Wolfgang Mader
    On Vertex-Edge-Critically n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:257-271 [Journal]
  10. Wolfgang Mader
    On Vertices of Degree n in Minimally n-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:81-95 [Journal]
  11. Wolfgang Mader
    High connectivity keeping sets in graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:302, n:1-3, pp:173-187 [Journal]
  12. Wolfgang Mader
    On k-con-Critically n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:296-314 [Journal]
  13. Wolfgang Mader
    Minimal n-fach zusammenhängende Digraphen. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:102-117 [Journal]
  14. Wolfgang Mader
    Kritisch n-fach kantenzusammenhängende Graphen. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:152-158 [Journal]
  15. Wolfgang Mader
    Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:45-57 [Journal]
  16. Wolfgang Mader
    Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:2, pp:260-272 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002