| Publication | Date of Publication | Type |
|---|
| A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdős condition | 2016-07-01 | Paper |
| On spanning trees with restricted degrees | 2016-06-16 | Paper |
| Rainbow cycles in edge-colored graphs | 2016-01-21 | Paper |
| A rainbow \(k\)-matching in the complete graph with \(r\) colors | 2009-07-08 | Paper |
| Contractible edges in minimally \(k\)-connected graphs | 2008-01-28 | Paper |
| Spanning trees with leaf distance at least four | 2007-06-11 | Paper |
| Vertices of degree 6 in a 6-contraction critical graph | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433933 | 2007-04-23 | Paper |
| Packing two copies of a tree into its third power | 2006-10-30 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708555 | 2005-11-18 | Paper |
| SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS | 2005-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692715 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461555 | 2005-07-26 | Paper |
| ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE | 2005-06-10 | Paper |
| Vertices of degree 5 in a contraction critically 5-connected graph | 2005-05-12 | Paper |
| Partitioning complete multipartite graphs by monochromatic trees | 2005-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657582 | 2005-03-14 | Paper |
| Long cycles in triangle-free graphs with prescribed independence number and connectivity | 2004-08-06 | Paper |
| Vertices of degree 6 in a contraction critically 6-connected graph | 2004-01-05 | Paper |
| A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition | 2003-08-20 | Paper |
| A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two | 2003-08-17 | Paper |
| Cycles having the same modularity and removable edges in 2-connected graphs | 2003-05-25 | Paper |
| Edge-wide-diameter of graphs with diameter \(d\) | 2003-03-25 | Paper |
| Perfect partitions of convex sets in the plane | 2003-03-17 | Paper |
| On a Hamiltonian cycle in which specified vertices are uniformly distributed | 2002-12-10 | Paper |
| On minimally \((n,\lambda)\)-connected graphs | 2002-12-10 | Paper |
| On a 2-factor with a specified edge in a graph satisfying the Ore condition | 2002-12-02 | Paper |
| On a Hamiltonian cycle in which specified vertices are not isolated | 2002-12-02 | Paper |
| On geometric independency trees for points in the plane | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547804 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547805 | 2002-08-21 | Paper |
| The connectivities of leaf graphs of sets of points in the plane | 2002-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504015 | 2002-03-18 | Paper |
| Path factors in claw-free graphs | 2002-03-13 | Paper |
| String decompositions of graphs | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504022 | 2001-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514553 | 2001-03-30 | Paper |
| On packing 3-vertex paths in a graph | 2001-01-01 | Paper |
| Spanning trees with constraints on the leaf degree | 2001-01-01 | Paper |
| Straight line embeddings of rooted star forests in the plane | 2000-08-06 | Paper |
| A degree condition for the existence of 1-factors in graphs or their complements | 2000-04-10 | Paper |
| Straight-line embeddings of two rooted trees in the plane | 2000-04-09 | Paper |
| On the number of acute triangles in a straight-line embedding of a maximal planar graph | 2000-02-16 | Paper |
| Balanced partitions of two sets of points in the plane | 2000-01-04 | Paper |
| The connectivities of leaf graphs of 2-connected graphs | 1999-12-20 | Paper |
| On decomposition of triangle-free graphs under degree constraints | 1998-07-27 | Paper |
| The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) | 1997-02-17 | Paper |
| Relative length of long paths and cycles in graphs with large degree sums | 1996-07-14 | Paper |
| A remark on the connectivity of the complement of a 3-connected graph | 1996-07-03 | Paper |
| Degree Sums and Covering Cycles | 1996-01-01 | Paper |
| The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint | 1995-03-27 | Paper |
| A mixed version of Menger's theorem | 1992-06-27 | Paper |
| Cycles intersecting a prescribed vertex set | 1992-06-27 | Paper |
| Paths and cycles concerning independence edges | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211348 | 1988-01-01 | Paper |
