| Publication | Date of Publication | Type |
|---|
| A generalization of a theorem of Nash-Williams | 2022-11-29 | Paper |
| On the necessity of Chvátal’s Hamiltonian degree condition | 2021-09-01 | Paper |
| Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor | 2017-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2971216 | 2017-04-04 | Paper |
| Vertex arboricity and vertex degrees | 2016-11-29 | Paper |
| Orienting graphs to optimize reachability | 2016-06-01 | Paper |
| Best monotone degree conditions for binding number and cycle structure | 2015-09-21 | Paper |
| Best monotone degree conditions for graph properties: a survey | 2015-01-20 | Paper |
| Toughness and binding number | 2014-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405465 | 2014-04-02 | Paper |
| Toughness and Vertex Degrees | 2013-03-07 | Paper |
| Degree sequences and the existence of \(k\)-factors | 2012-12-27 | Paper |
| Binding Number, Minimum Degree, and Cycle Structure in Graphs | 2012-09-12 | Paper |
| Best monotone degree conditions for binding number | 2011-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070257 | 2011-02-02 | Paper |
| Sufficient degree conditions fork-edge-connectedness of a graph | 2010-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568730 | 2010-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615980 | 2009-03-24 | Paper |
| Tutte sets in graphs I: Maximal tutte sets and D-graphs | 2007-08-09 | Paper |
| Tutte sets in graphs. II: The complexity of finding maximum Tutte sets | 2007-06-26 | Paper |
| Toughness in graphs -- a survey | 2006-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708558 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708601 | 2005-11-18 | Paper |
| Improved bounds for the chromatic number of a graph | 2005-02-16 | Paper |
| Toughness, minimum degree, and spanning cubic subgraphs | 2004-03-15 | Paper |
| Bounds for the chromatic number of graphs with partial information | 2003-04-09 | Paper |
| Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934867 | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2713622 | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2713657 | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489197 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719322 | 2000-04-09 | Paper |
| On the cost chromatic number of outerplanar, planar, and line graphs | 1998-11-08 | Paper |
| The complexity of recognizing tough cubic graphs | 1998-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355483 | 1997-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879177 | 1997-06-29 | Paper |
| A note on dominating cycles in 2-connected graphs | 1997-06-22 | Paper |
| Gossiping with multiple sends and receives | 1997-05-20 | Paper |
| Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem | 1996-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871126 | 1996-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873795 | 1996-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873682 | 1996-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871173 | 1996-03-28 | Paper |
| Star arboricity of graphs | 1996-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863407 | 1996-02-06 | Paper |
| Toughness and triangle-free graphs | 1996-01-29 | Paper |
| Degree‐bounded coloring of graphs: Variations on a theme by brooks | 1995-10-31 | Paper |
| Gale's Round-Trip Jeep Problem | 1995-09-17 | Paper |
| Fitting polygonal functions to a set of points in the plane | 1995-03-09 | Paper |
| Toughness, minimum degree, and the existence of 2‐factors | 1994-09-11 | Paper |
| Parallel Information Dissemination by Packets | 1994-05-10 | Paper |
| On the complexity of recognizing tough graphs | 1994-03-10 | Paper |
| Approximation algorithms for the capacitated plant allocation problem | 1994-01-01 | Paper |
| On locating path- or tree-shaped facilities on networks | 1993-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139757 | 1993-11-11 | Paper |
| The Voronoi Partition of a Network and Its Implications in Location Theory | 1993-02-25 | Paper |
| Sequential information dissemination by packets | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014299 | 1992-10-06 | Paper |
| On felicitous graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984510 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976600 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976633 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972137 | 1992-06-25 | Paper |
| Long cycles in graphs with large degree sums | 1990-01-01 | Paper |
| Parallel algorithms for gossiping by mail | 1990-01-01 | Paper |
| Hamiltonian degree conditions which imply a graph is pancyclic | 1990-01-01 | Paper |
| Recognizing tough graphs is NP-hard | 1990-01-01 | Paper |
| A simple proof of a theorem of Jung | 1990-01-01 | Paper |
| A Note on the Vertex Arboricity of a Graph | 1989-01-01 | Paper |
| A cycle structure theorem for Hamiltonian graphs | 1988-01-01 | Paper |
| Chromatic factorizations of a graph | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820627 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829577 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3831040 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206769 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344225 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680866 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3699724 | 1985-01-01 | Paper |
| An adaptive algorithm for system level diagnosis | 1984-01-01 | Paper |
| Bounds on the number of cycles of length three in a planar graph | 1982-01-01 | Paper |
| On the maximum number of independent edges in cubic graphs | 1982-01-01 | Paper |
| The basis number of the \(n\)-cube | 1982-01-01 | Paper |
| Bipartite graphs with cycles of all even lengths | 1982-01-01 | Paper |
| The basis number of a graph | 1981-01-01 | Paper |
| The number of triangles in a triangulation of a set of points in the plane | 1980-01-01 | Paper |
| Connectivity, genus, and the number of components in vertex-deleted subgraphs | 1979-01-01 | Paper |
| On the number of hamiltonian cycles in a maximal planar graph | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942982 | 1979-01-01 | Paper |
| On the number of cycles of lengthk in a maximal planar graph | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156463 | 1978-01-01 | Paper |
| Systematic searches for hypohamiltonian graphs | 1978-01-01 | Paper |
| On the connectivity of maximal planar graphs | 1978-01-01 | Paper |
| New flip-flop constructions for hypohamiltonian graphs | 1977-01-01 | Paper |
| On Planar Graphical Degree Sequences | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180395 | 1977-01-01 | Paper |
| A note on the edge reconstruction conjecture | 1975-01-01 | Paper |
| Pancyclic graphs and a conjecture of Bondy and Chvatal | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5684711 | 1974-01-01 | Paper |
