| Publication | Date of Publication | Type |
|---|
| Refinements of degree conditions for the existence of a spanning tree without small degree stems | 2024-12-02 | Paper |
| On 2-factors with a specified number of components in line graphs | 2024-10-18 | Paper |
| A bound on relative lengths of triangle-free graphs | 2024-05-21 | Paper |
| A note on secure domination in \(C_5\)-free graphs | 2023-04-27 | Paper |
| Representing split graphs by words | 2022-07-26 | Paper |
| Distance matching extension in cubic bipartite graphs | 2021-11-25 | Paper |
| Spanning bipartite graphs with large degree sum in graphs of odd order | 2021-11-25 | Paper |
| Implications in rainbow forbidden subgraphs | 2021-03-25 | Paper |
| On semi-transitive orientability of Kneser graphs and their complements | 2020-06-08 | Paper |
| Distance matching extension and local structure of graphs | 2020-05-21 | Paper |
| Spanning bipartite graphs with high degree sum in graphs | 2019-12-17 | Paper |
| Pairs and triples of forbidden subgraphs and the existence of a 2‐factor | 2019-06-14 | Paper |
| Cycles with a chord in dense graphs | 2018-06-07 | Paper |
| Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs | 2017-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4594213 | 2017-11-17 | Paper |
| Edge proximity and matching extension in punctured planar triangulations | 2017-09-18 | Paper |
| Toughness, binding number and restricted matching extension in a graph | 2017-09-05 | Paper |
| The Ryjáček closure and a forbidden subgraph | 2016-07-13 | Paper |
| Ralph Faudree (1938--2015) | 2016-04-27 | Paper |
| Spanning trees homeomorphic to a small tree | 2015-12-08 | Paper |
| Forbidden triples generating a finite set of 3-connected graphs | 2015-08-27 | Paper |
| Perfect matchings avoiding prescribed edges in a star-free graph | 2015-08-05 | Paper |
| A note on graphs contraction-critical with respect to independence number | 2014-05-06 | Paper |
| The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition | 2014-04-10 | Paper |
| Precoloring extension involving pairs of vertices of small distance | 2014-02-18 | Paper |
| Forbidden subgraphs generating a finite set | 2013-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4897473 | 2012-12-19 | Paper |
| Star-factors with large components | 2012-06-18 | Paper |
| Closures, cycles, and paths | 2012-06-13 | Paper |
| A pair of forbidden subgraphs and 2-factors | 2012-05-14 | Paper |
| A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity | 2012-04-26 | Paper |
| Hamiltonian cycles with all small even chords | 2012-04-13 | Paper |
| Clique or hole in claw-free graphs | 2012-03-19 | Paper |
| Forbidden pairs for \(k\)-connected Hamiltonian graphs | 2012-03-16 | Paper |
| The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity | 2011-10-12 | Paper |
| Closure for spanning trees and distant area | 2011-10-05 | Paper |
| Forbidden triples for perfect matchings | 2011-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001401 | 2011-05-31 | Paper |
| Small alliances in a weighted graph | 2010-11-25 | Paper |
| Forbidden subgraphs and the existence of a 2-factor | 2010-11-10 | Paper |
| Closure, stability and iterated line graphs with a 2-factor | 2009-12-15 | Paper |
| Two forbidden subgraphs and the existence of a 2-factor in graphs | 2009-07-06 | Paper |
| Chvátal–Erdős Theorem: Old Theorem with New Aspects | 2009-01-13 | Paper |
| Chvátal Erdős condition and 2-factors with a specyfied number of components | 2008-06-18 | Paper |
| Independence and 2-domination in bipartite graphs | 2008-03-11 | Paper |
| Edge-dominating cycles in graphs | 2007-11-30 | Paper |
| Reduction for 3-connected graphs of minimum degree at least four | 2007-07-19 | Paper |
| Graphs with small boundary | 2007-05-11 | Paper |
| Degree conditions for Hamiltonicity: counting the number of missing edges | 2007-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480725 | 2006-08-03 | Paper |
| Domination in a graph with a 2‐factor | 2006-06-06 | Paper |
| A pair of forbidden subgraphs and perfect matchings. | 2006-05-18 | Paper |
| A note on 2-factors with two components | 2005-10-26 | Paper |
| Forbidden subgraphs and bounds on the size of a maximum matching | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466015 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466035 | 2005-08-23 | Paper |
| A note on internally disjoint alternating paths in bipartite graphs | 2005-02-22 | Paper |
| Toughness, degrees and 2-factors | 2004-11-22 | Paper |
| Long cycles in triangle-free graphs with prescribed independence number and connectivity | 2004-08-06 | Paper |
| Vertex-disjoint cycles containing specified vertices in a bipartite graph | 2004-08-04 | Paper |
| Cycles within specified distance from each vertex. | 2004-03-14 | Paper |
| \(M\)-alternating paths in \(n\)-extendable bipartite graphs | 2003-08-19 | Paper |
| Splitting and contractible edges in 4-connected graphs | 2003-08-17 | Paper |
| On two equimatchable graph classes | 2003-06-09 | Paper |
| Factor criticality and complete closure of graphs | 2003-05-25 | Paper |
| Cycles having the same modularity and removable edges in 2-connected graphs | 2003-05-25 | Paper |
| Degree conditions for k‐ordered hamiltonian graphs | 2003-04-03 | Paper |
| Claw-free graphs with complete closure | 2002-10-24 | Paper |
| Relative length of longest paths and cycles in 3-connected graphs | 2002-08-08 | Paper |
| Hamiltonian cycles in n‐extendable graphs | 2002-07-11 | Paper |
| The Hamiltonicity of bipartite graphs involving neighborhood unions | 2002-05-28 | Paper |
| Hamiltonian cycles in \(n\)-factor-critical graphs | 2002-04-16 | Paper |
| 2-factors in claw-free graphs | 2002-02-17 | Paper |
| Vertex-disjoint cycles containing specified edges in a bipartite graph | 2002-01-21 | Paper |
| Closure and factor-critical graphs | 2000-12-13 | Paper |
| Neighborhood unions and factor critical graphs | 2000-04-09 | Paper |
| Closure, 2-factors, and cycle coverings in claw-free graphs | 2000-02-27 | Paper |
| Closure and Hamiltonian-connectivity of claw-free graphs | 1999-11-02 | Paper |
| Degree sums and graphs that are not covered by two cycles | 1999-09-22 | Paper |
| Long paths, long cycles, and their relative length | 1999-06-23 | Paper |
| Two recursive theorems on \(n\)-extendibility | 1997-06-10 | Paper |
| Fan-type theorem for path-connectivity | 1997-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874597 | 1996-12-01 | Paper |
| Relative length of long paths and cycles in graphs with large degree sums | 1996-07-14 | Paper |
| Essential independent sets and Hamiltonian cycles | 1996-02-25 | Paper |
| Non-contractible edges in a 3-connected graph | 1995-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288148 | 1994-09-01 | Paper |
| Cycles of length 0 modulo 4 in graphs | 1994-06-08 | Paper |
| Graphs with a cycle of length divisible by three | 1994-06-06 | Paper |
| Multiple assignment scheme for sharing secret | 1993-05-16 | Paper |
| Cycles of length 2 modulo 3 in graphs | 1993-01-16 | Paper |
| One-factors and \(k\)-factors | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990586 | 1992-06-28 | Paper |
| Contractible edges in non-separating cycles | 1992-06-27 | Paper |
| Cycles intersecting a prescribed vertex set | 1992-06-27 | Paper |
| Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets | 1992-06-25 | Paper |
| Partitioning regular graphs into equicardinal linear forests | 1992-06-25 | Paper |
| Removable edges in 3-connected graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3487381 | 1990-01-01 | Paper |
| Long cycles through specified vertices in a graph | 1989-01-01 | Paper |
| Factors and induced subgraphs | 1988-01-01 | Paper |
| Contractible edges in 3-connected graphs | 1987-01-01 | Paper |
| On component factors | 1986-01-01 | Paper |
| Regular factors of regular graphs | 1985-01-01 | Paper |
| Toughness and the existence ofk-factors | 1985-01-01 | Paper |
| The binding number of line graphs and total graphs | 1985-01-01 | Paper |
| Disjoint shortest paths in graphs | 1984-01-01 | Paper |
| [a,b]-factors of graphs | 1983-01-01 | Paper |
| Refinements of degree conditions for the existence of a spanning tree without small degree stems | N/A | Paper |
