default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWolfgang Mader 0001
Person information
- affiliation: University of Hanover, Hannover, Germany
Other persons with the same name
- Wolfgang Mader 0002
![[0000-0001-8623-5190]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8623-5190")
— University of Freiburg, Freiburg im Breisgau, Germany - Wolfgang Mader 0003 — Ulm University, Institute of Neurobiology, Germany
- Wolfgang Mader 0004 — SPES Academy, Schlierbach, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j30]Wolfgang Mader:
Connectivity keeping trees in k-connected graphs. J. Graph Theory 69(3): 324-329 (2012)- 2010
- [j29]Wolfgang Mader:
Openly disjoint circuits through a vertex in regular digraphs. Discret. Math. 310(20): 2671-2674 (2010) - [j28]Wolfgang Mader:
Existence of openly disjoint circuits through a vertex. J. Graph Theory 63(2): 93-105 (2010) - [j27]Wolfgang Mader:
Connectivity keeping paths in k-connected graphs. J. Graph Theory 65(1): 61-69 (2010)
2000 – 2009
- 2005
- [j26]Wolfgang Mader:
Graphs With 3n-6 Edges Not Containing A Subdivision Of K5. Comb. 25(4): 425-438 (2005) - [j25]Wolfgang Mader:
High connectivity keeping sets in graphs and digraphs. Discret. Math. 302(1-3): 173-187 (2005) - 2004
- [j24]Wolfgang Mader:
High Connectivity Keeping Sets In n-Connected Graphs. Comb. 24(3): 441-458 (2004) - 2002
- [j23]Wolfgang Mader:
On k-con-Critically n-Connected Graphs. J. Comb. Theory B 86(2): 296-314 (2002) - [j22]Wolfgang Mader:
On Vertices of outdegree n in minimally n-connected digraphs. J. Graph Theory 39(2): 129-144 (2002) - [j21]Roland Häggkvist, Wolfgang Mader:
Circuits through prescribed vertices in k-connected k-regular graphs. J. Graph Theory 39(2): 145-163 (2002) - 2001
- [j20]Wolfgang Mader:
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. Comb. 21(2): 251-265 (2001)
1990 – 1999
- 1999
- [j19]Wolfgang Mader:
An extremal problem for subdivisions of K. J. Graph Theory 30(4): 261-276 (1999) - 1998
- [j18]Wolfgang Mader:
Topological Subgraphs in Graphs of Large Girth. Comb. 18(3): 405-412 (1998) - [j17]Wolfgang Mader:
3n - 5 Edges Do Force a Subdivision of K5. Comb. 18(4): 569-595 (1998) - 1997
- [c1]Wolfgang Mader:
Topological minors in graphs of minimum degree n. Contemporary Trends in Discrete Mathematics 1997: 199-211 - 1996
- [j16]Wolfgang Mader:
On topological tournaments of order 4 in digraphs of outdegree 3. J. Graph Theory 21(4): 371-376 (1996) - 1995
- [j15]Wolfgang Mader:
Existence of Vertices of Local Connectivity k in Digraphs of Large Outdegree. Comb. 15(4): 533-539 (1995) - [j14]Wolfgang Mader:
On Vertices of Degree n in Minimally n-Edge-Connected Graphs. Comb. Probab. Comput. 4: 81-95 (1995) - 1994
- [j13]Wolfgang Mader:
On Vertex-Edge-Critically n-Connected Graphs. Comb. Probab. Comput. 3: 257-271 (1994) - 1991
- [j12]Wolfgang Mader:
Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen. J. Comb. Theory B 53(2): 260-272 (1991)
1980 – 1989
- 1989
- [j11]Wolfgang Mader:
On critically connected digraphs. J. Graph Theory 13(4): 513-522 (1989) - 1988
- [j10]Wolfgang Mader:
Generalizations of critical connectivity of graphs. Discret. Math. 72(1-3): 267-283 (1988) - [j9]Wolfgang Mader:
Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. J. Comb. Theory B 45(1): 45-57 (1988) - 1986
- [j8]Wolfgang Mader:
Kritisch n-fach kantenzusammenhängende Graphen. J. Comb. Theory B 40(2): 152-158 (1986) - 1985
- [j7]Wolfgang Mader:
Degree and local connectivity in digraphs. Comb. 5(2): 161-165 (1985) - [j6]Wolfgang Mader:
Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen. Eur. J. Comb. 6(4): 353-359 (1985) - [j5]Wolfgang Mader:
Paths in graphs, reducing the edge-connectivity only by two. Graphs Comb. 1(1): 81-89 (1985) - [j4]Wolfgang Mader:
Minimal n-fach zusammenhängende Digraphen. J. Comb. Theory B 38(2): 102-117 (1985) - 1982
- [j3]Wolfgang Mader:
Konstruktion aller n-fach kantenzusammenhängenden Digraphen. Eur. J. Comb. 3(1): 63-67 (1982) - 1981
- [j2]Wolfgang Mader:
On a property of n-edge-connected digraphs. Comb. 1(4): 385-386 (1981)
1970 – 1979
- 1978
- [j1]Wolfgang Mader:
Über n-fach zusammenhängende Eckenmengen in Graphen. J. Comb. Theory B 25(1): 74-93 (1978)
1960 – 1969
- 1967
- [b1]Wolfgang Mader:
Über trennende Eckenmengen in homomorphiekritischen Graphen. University of Cologne, Germany, 1967, pp. 1-252
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
