| Publication | Date of Publication | Type |
|---|
| Critical vertices in \(k\)-connected digraphs | 2018-01-05 | Paper |
| Connectivity keeping trees in \(k\)-connected graphs | 2012-06-13 | Paper |
| Connectivity keeping paths in k-connected graphs | 2010-11-10 | Paper |
| Openly disjoint circuits through a vertex in regular digraphs | 2010-10-18 | Paper |
| Existence of openly disjoint circuits through a vertex | 2010-04-22 | Paper |
| Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\) | 2006-06-27 | Paper |
| High connectivity keeping sets in graphs and digraphs | 2005-12-06 | Paper |
| High connectivity keeping sets in \(n\)-connected graphs | 2005-02-14 | Paper |
| On \(k\)-con-critically \(n\)-connected graphs | 2003-08-20 | Paper |
| Circuits through prescribed vertices in k‐connected k‐regular graphs | 2002-12-11 | Paper |
| On Vertices of outdegree n in minimally n‐connected digraphs | 2002-12-02 | Paper |
| Subdivisions of a graph of maximal degree \(n+1\) in graphs of average degree \(n+\epsilon\) and large girth | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263477 | 2000-02-16 | Paper |
| \(3n-5\) edges do force a subdivision of \(K_5\) | 1999-10-31 | Paper |
| Topological subgraphs in graphs of large girth | 1999-10-31 | Paper |
| An extremal problem for subdivisions ofK?5 | 1999-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347908 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878669 | 1996-11-03 | Paper |
| Existence of vertices of local connectivity \(k\) in digraphs of large outdegree | 1996-05-30 | Paper |
| On topological tournaments of order 4 in digraphs of outdegree 3 | 1996-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873756 | 1996-04-22 | Paper |
| On Vertices of Degree n in Minimally n-Edge-Connected Graphs | 1995-08-27 | Paper |
| On Vertex-Edge-Critically n-Connected Graphs | 1995-03-08 | Paper |
| Vertices of small degree in critically \(n\)-connected digraphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204497 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818349 | 1989-01-01 | Paper |
| On critically connected digraphs | 1989-01-01 | Paper |
| Generalizaions of critical connectivity of graphs | 1988-01-01 | Paper |
| Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) | 1988-01-01 | Paper |
| Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) | 1986-01-01 | Paper |
| Degree and local connectivity in digraphs | 1985-01-01 | Paper |
| Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen | 1985-01-01 | Paper |
| Paths in graphs, reducing the edge-connectivity only by two | 1985-01-01 | Paper |
| Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676170 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220626 | 1984-01-01 | Paper |
| On N–Edge–Connected Digraphs | 1983-01-01 | Paper |
| Konstruktion aller n-fach kantenzusammenhaengenden Digraphen | 1982-01-01 | Paper |
| On a property of n-edge-connected digraphs | 1981-01-01 | Paper |
| Über ein graphentheoretisches Ergebnis von T. Gallai | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4189309 | 1979-01-01 | Paper |
| Zur Struktur minimal n-fach zusammenhängender Graphen | 1979-01-01 | Paper |
| Über die Maximalzahl kreuzungsfreier H-Wege | 1979-01-01 | Paper |
| Eine Reduktionsmethode für den Kantenzusammenhang in Graphen | 1979-01-01 | Paper |
| Über ein graphentheoretisches Problem von T. Gallai | 1979-01-01 | Paper |
| A Reduction Method for Edge-Connectivity in Graphs | 1978-01-01 | Paper |
| Über die Maximalzahl kantendisjunkter A-Wege | 1978-01-01 | Paper |
| Über n-fach zusammenhängende Eckenmengen in Graphen | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4172085 | 1978-01-01 | Paper |
| Endlichkeitssätze für k-kritische Graphen | 1977-01-01 | Paper |
| Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4063485 | 1976-01-01 | Paper |
| Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4060988 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4087224 | 1975-01-01 | Paper |
| Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen | 1974-01-01 | Paper |
| Kreuzungsfreie a,b-Wege in endlichen Graphen | 1974-01-01 | Paper |
| Kantendisjunkte Wege in Graphen | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777330 | 1974-01-01 | Paper |
| 1-Faktoren von Graphen. (1-factors of graphs) | 1973-01-01 | Paper |
| Ein Extremalproblem des Zusammenhangs von Graphen | 1973-01-01 | Paper |
| Grad und lokaler Zusammenhang in endlichen Graphen | 1973-01-01 | Paper |
| Über die Anzahl der von den 1‐Faktoren eines Graphen überdeckten Ecken | 1973-01-01 | Paper |
| Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen | 1972-01-01 | Paper |
| Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem) | 1972-01-01 | Paper |
| Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte | 1972-01-01 | Paper |
| Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind | 1972-01-01 | Paper |
| Wohlquasigeordnete Klassen endlicher Graphen | 1972-01-01 | Paper |
| Minimale \(n\)-fach kantenzusammenhängende Graphen | 1971-01-01 | Paper |
| Eine Eigenschaft der Atome endlicher Graphen | 1971-01-01 | Paper |
| Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte | 1971-01-01 | Paper |
| Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl. | 1971-01-01 | Paper |
| Eine Eigenschaft der Atome endlicher Graphen | 1971-01-01 | Paper |
| Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl. | 1971-01-01 | Paper |
| Über den Zusammenhang symmetrischer Graphen | 1970-01-01 | Paper |
| Homomorphiesätze für Graphen | 1968-01-01 | Paper |
| Über trennende Eckenmengen in homomorphiekritischen Graphen | 1968-01-01 | Paper |
| Homomorphieeigenschaften und mittlere Kantendichte von Graphen | 1967-01-01 | Paper |
