| 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 |
| 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 |
| Toughness, minimum degree, and spanning cubic subgraphs | 2004-03-15 | Paper |
| Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489197 | 2000-10-23 | Paper |
| Long cycles in 3-cyclable graphs | 2000-08-28 | Paper |
| Not every 2-tough graph is Hamiltonian | 2000-04-09 | Paper |
| Chordality and 2-factors in tough graphs | 2000-01-30 | Paper |
| The complexity of recognizing tough cubic graphs | 1998-01-07 | Paper |
| 2-factors in triangle-free graphs | 1997-06-29 | Paper |
| A note on dominating cycles in 2-connected graphs | 1997-06-22 | 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/Q4863407 | 1996-02-06 | Paper |
| Toughness and triangle-free graphs | 1996-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856626 | 1995-12-03 | Paper |
| Long cycles in graphs with prescribed toughness and minimum degree | 1995-07-24 | Paper |
| Toughness, minimum degree, and the existence of 2‐factors | 1994-11-28 | Paper |
| Toughness, minimum degree, and the existence of 2‐factors | 1994-09-11 | Paper |
| On the complexity of recognizing tough graphs | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139757 | 1993-11-11 | Paper |
| Hamiltonian properties of graphs with large neighborhood unions | 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/Q3971997 | 1992-06-25 | Paper |
| Long cycles in graphs with large degree sums | 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 |
| https://portal.mardi4nfdi.de/entity/Q3470493 | 1990-01-01 | Paper |
| A generalization of a result of Häggkvist and Nicoghossian | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816097 | 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/Q4206769 | 1987-01-01 | Paper |
| Combinatorial optimization problems in the analysis and design of probabilistic networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757937 | 1985-01-01 | Paper |
| Extremal non-bipartite regular graphs of girth 4 | 1984-01-01 | Paper |
| Domination alteration sets in graphs | 1983-01-01 | Paper |
| Regular \(K_n\)-free graphs | 1983-01-01 | Paper |
| Graphs isomorphic to subgraphs of their line-graphs | 1982-01-01 | Paper |
| The connectivities of line and total graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967562 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922713 | 1981-01-01 | Paper |
| Line-graphical degree sequences | 1980-01-01 | Paper |
| Graphs with prescribed connectivity and line graph connectivity | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3924249 | 1979-01-01 | Paper |
