| Publication | Date of Publication | Type |
|---|
| Edge proximity conditions for extendability in regular bipartite graphs | 2023-10-09 | Paper |
| Removal of subgraphs and perfect matchings in graphs on surfaces | 2023-10-06 | Paper |
| Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane | 2022-03-31 | Paper |
| Distance matching extension in cubic bipartite graphs | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4990102 | 2021-05-28 | Paper |
| Restricted matching in plane triangulations and near triangulations | 2020-07-07 | Paper |
| Distance matching extension and local structure of graphs | 2020-05-21 | Paper |
| Extendability and criticality in matching theory | 2020-04-30 | Paper |
| Cycles in 5-connected triangulations | 2020-01-15 | Paper |
| Pairs and triples of forbidden subgraphs and the existence of a 2‐factor | 2019-06-14 | Paper |
| Edge proximity and matching extension in punctured planar triangulations | 2017-09-18 | Paper |
| Matching extension in prism graphs | 2017-02-27 | Paper |
| Distance matching in punctured planar triangulations | 2016-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3451458 | 2015-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5249239 | 2015-04-30 | Paper |
| The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] | 2015-04-28 | Paper |
| Circular designs balanced for neighbours at distances one and two | 2014-12-22 | Paper |
| Distance-restricted matching extension in triangulations of the torus and the Klein bottle | 2014-09-30 | Paper |
| The maximum number of minimal codewords in an \([n,k\)-code] | 2014-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2866615 | 2013-12-13 | Paper |
| The maximum number of minimal codewords in long codes | 2013-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4898132 | 2012-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166118 | 2012-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2895361 | 2012-07-02 | Paper |
| Proximity thresholds for matching extension in the torus and Klein bottle | 2012-05-30 | Paper |
| The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity | 2011-10-12 | Paper |
| Proximity thresholds for matching extension in planar and projective planar triangulations | 2011-05-11 | Paper |
| Forbidden subgraphs and the existence of a 2-factor | 2010-11-10 | Paper |
| Distance-restricted matching extension in planar triangulations | 2010-10-18 | Paper |
| The structure of \(4-\gamma \)-critical graphs with a cut vertex | 2010-10-11 | Paper |
| Avoiding consecutive patterns in permutations | 2010-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574140 | 2010-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3635524 | 2009-07-06 | Paper |
| Graph structural properties of non-Yutsis graphs allowing fast recognition | 2009-03-04 | Paper |
| Restricted matching in graphs of small genus | 2009-01-28 | Paper |
| Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404] | 2009-01-21 | Paper |
| \(k\)-factors in regular graphs and edge-connectivity | 2008-11-03 | Paper |
| On the maximum number of cycles in a planar graph | 2008-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442370 | 2008-02-22 | Paper |
| On the matching extendability of graphs in surfaces | 2007-12-10 | Paper |
| Perfect matchings after vertex deletions | 2007-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294912 | 2007-07-26 | Paper |
| Edge proximity conditions for extendability in cubic bipartite graphs | 2007-06-11 | Paper |
| Permuting machines and priority queues | 2006-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708984 | 2005-11-21 | Paper |
| Sorting classes | 2005-11-01 | Paper |
| Vertex colouring edge partitions | 2005-08-05 | Paper |
| 2‐factors with prescribed and proscribed edges | 2005-06-01 | Paper |
| Graphs and digraphs with all 2-factors isomorphic | 2005-02-16 | Paper |
| Restricted permutations and queue jumping | 2004-11-18 | Paper |
| Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs | 2004-11-18 | Paper |
| Regular bipartite graphs with all 2-factors isomorphic | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820780 | 2004-10-01 | Paper |
| Graphs with not all possible path-kernels | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474102 | 2004-08-04 | Paper |
| \(M\)-alternating paths in \(n\)-extendable bipartite graphs | 2003-08-19 | Paper |
| Completing Latin squares: Critical sets | 2003-03-19 | Paper |
| A note on the number of graceful labellings of paths | 2003-03-16 | Paper |
| Permutations of a multiset avoiding permutations of length 3 | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760442 | 2002-01-02 | Paper |
| On restricted matching extension in planar graphs | 2001-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488582 | 2000-12-03 | Paper |
| Nonhamiltonian 3-Connected Cubic Planar Graphs | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222072 | 2000-02-09 | Paper |
| Cycles through 23 vertices in 3-connected cubic planar graphs | 2000-01-30 | Paper |
| Two results on matching extensions with prescribed and proscribed edge sets | 2000-01-27 | Paper |
| On matching extensions with prescribed and proscribed edge sets. II | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269437 | 1999-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208427 | 1999-04-08 | Paper |
| On the number of cycles in 3-connected cubic graphs | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4379742 | 1998-07-12 | Paper |
| P3-isomorphisms for graphs | 1998-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337357 | 1998-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349610 | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876750 | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876739 | 1996-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892325 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863415 | 1996-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863509 | 1996-02-06 | Paper |
| On the density of sets of divisors | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842709 | 1995-08-16 | Paper |
| Generalised powers revisited | 1995-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304578 | 1995-03-12 | Paper |
| A degree characterisation of pancyclicity | 1995-01-26 | Paper |
| The 3‐connected graphs with a maximum matching containing precisely one contractible edge | 1994-08-29 | Paper |
| N‐extendability of symmetric graphs | 1994-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139280 | 1993-11-11 | Paper |
| The 3‐connected graphs having a longest cycle containing only three contractible edges | 1993-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033684 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033685 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028475 | 1993-03-28 | Paper |
| Uniform cyclic edge connectivity in cubic graphs | 1992-06-27 | Paper |
| Partitioning regular graphs into equicardinal linear forests | 1992-06-25 | Paper |
| Distance-regular antipodal covering graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824440 | 1988-01-01 | Paper |
| An 11-vertex theorem for 3-connected cubic graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729822 | 1988-01-01 | Paper |
| Distance-regular antipodal covering graphs | 1988-01-01 | Paper |
| Cycles through five edges in 3-connected cubic graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3764157 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768931 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781781 | 1987-01-01 | Paper |
| Cycles through four edges in 3-connected cubic graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322126 | 1984-01-01 | Paper |
