| Publication | Date of Publication | Type |
|---|
| Dense circuit graphs and the planar Turán number of a cycle | 2024-11-24 | Paper |
| Linkages and removable paths avoiding vertices | 2024-10-08 | Paper |
| A class of trees determined by their chromatic symmetric functions | 2024-06-11 | Paper |
| On approximations for constructing required subgraphs using stock pieces of fixed length | 2024-02-23 | Paper |
| Dense circuit graphs and the planar Tur\'an number of a cycle | 2023-10-10 | Paper |
| 4‐Separations in Hajós graphs | 2023-10-05 | Paper |
| Partitioning digraphs with outdegree at least 4 | 2023-10-04 | Paper |
| Wheels in planar graphs and Hajós graphs | 2023-10-04 | Paper |
| Co-degree threshold for rainbow perfect matchings in uniform hypergraphs | 2023-09-19 | Paper |
| Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs | 2023-08-10 | Paper |
| Planar Tur\'an number of the 7-cycle | 2023-06-23 | Paper |
| Linkages and removable paths avoiding vertices | 2023-03-21 | Paper |
| On stability of rainbow matchings | 2023-02-13 | Paper |
| A better bound on the size of rainbow matchings | 2023-01-04 | Paper |
| Approximating TSP walks in subcubic graphs | 2022-11-28 | Paper |
| Tutte paths and long cycles in circuit graphs | 2022-11-23 | Paper |
| On the rainbow matching conjecture for 3-uniform hypergraphs | 2022-10-25 | Paper |
| \(1\)-line minimum rectilinear Steiner trees and related problems | 2022-10-18 | Paper |
| Approximation algorithms for constructing required subgraphs using stock pieces of fixed length | 2022-10-04 | Paper |
| Rainbow perfect matchings for 4-uniform hypergraphs | 2022-07-28 | Paper |
| On judicious bipartitions of graphs | 2022-06-29 | Paper |
| Counting Hamiltonian cycles in planar triangulations | 2022-04-27 | Paper |
| A note on exact minimum degree threshold for fractional perfect matchings | 2022-04-11 | Paper |
| Approximating TSP walks in subcubic graphs | 2021-12-12 | Paper |
| On the 3-colorability of triangle-free and fork-free graphs | 2021-11-19 | Paper |
| Rainbow matchings for 3-uniform hypergraphs | 2021-07-14 | Paper |
| On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) | 2021-07-05 | Paper |
| On Tutte cycles containing three prescribed edges | 2021-06-17 | Paper |
| Number of Hamiltonian cycles in planar triangulations | 2021-05-28 | Paper |
| Nearly perfect matchings in uniform hypergraphs | 2021-05-28 | Paper |
| Monochromatic subgraphs in iterated triangulations | 2020-11-05 | Paper |
| The Kelmans-Seymour conjecture. I: Special separations | 2020-07-07 | Paper |
| The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) | 2020-07-07 | Paper |
| The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) | 2020-07-07 | Paper |
| The Kelmans-Seymour conjecture. IV: A proof | 2020-07-07 | Paper |
| Large cycles in essentially 4-connected graphs | 2020-03-21 | Paper |
| A bound on judicious bipartitions of directed graphs | 2020-03-06 | Paper |
| 7-connected graphs are 4-ordered | 2020-01-15 | Paper |
| Minimum codegree condition for perfect matchings in k‐partite k‐graphs | 2019-12-30 | Paper |
| On problems about judicious bipartitions of graphs | 2019-11-21 | Paper |
| Graph-Based Robust Resource Allocation for Cognitive Radio Networks | 2018-08-22 | Paper |
| Disjoint perfect matchings in 3‐uniform hypergraphs | 2018-07-13 | Paper |
| Almost perfect matchings in \(k\)-partite \(k\)-graphs | 2018-02-22 | Paper |
| On judicious bipartitions of graphs | 2018-02-22 | Paper |
| On Rainbow Matchings for Hypergraphs | 2018-02-07 | Paper |
| Bisections of graphs without short cycles | 2018-01-19 | Paper |
| Some results and problems about circumferences of graphs | 2017-12-11 | Paper |
| Circumference of 3-connected cubic graphs | 2017-11-28 | Paper |
| Induced forests in bipartite planar graphs | 2017-01-10 | Paper |
| Graphs containing topological \(H\) | 2016-06-10 | Paper |
| On a coloring conjecture of Hajós | 2016-03-02 | Paper |
| Nonseparating cycles avoiding specific vertices | 2016-02-01 | Paper |
| On tight components and anti-tight components | 2015-12-17 | Paper |
| Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) | 2015-06-10 | Paper |
| An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance | 2015-03-26 | Paper |
| Forbidden subgraphs and 3-colorings | 2014-12-22 | Paper |
| On judicious bisections of graphs | 2014-08-28 | Paper |
| Approximate min-max relations on plane graphs | 2013-08-09 | Paper |
| The circumference of a graph with no \(K_{3,t}\)-minor. II | 2013-01-14 | Paper |
| Maximum directed cuts in graphs with degree constraints | 2012-12-27 | Paper |
| Bonds with parity constraints | 2012-05-11 | Paper |
| Upper bounds on minimum balanced bipartitions | 2012-04-13 | Paper |
| Partitioning 3-uniform hypergraphs | 2012-03-19 | Paper |
| Maximum IPP codes of length 3 | 2012-01-24 | Paper |
| Better bounds for \(k\)-partitions of graphs | 2011-08-16 | Paper |
| Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs | 2011-05-19 | Paper |
| Approximating the chromatic index of multigraphs | 2011-03-17 | Paper |
| On a bipartition problem of Bollobás and Scott | 2011-02-08 | Paper |
| On several partitioning problems of Bollobás and Scott | 2010-11-05 | Paper |
| Independent paths and \(K_{5}\)-subdivisions | 2010-11-05 | Paper |
| A note on balanced bipartitions | 2010-10-18 | Paper |
| Bounds for pairs in partitions of graphs | 2010-07-07 | Paper |
| Balanced judicious bipartitions of graphs | 2010-03-15 | Paper |
| Hamilton Cycles in Planar Locally Finite Graphs | 2009-11-27 | Paper |
| Judicious \(k\)-partitions of graphs | 2009-03-04 | Paper |
| Hamilton circles in infinite planar graphs | 2009-01-21 | Paper |
| Truncation for Low-Complexity MIMO Signal Detection | 2008-12-21 | Paper |
| Infinite paths in planar graphs V, 3‐indivisible graphs | 2008-05-14 | Paper |
| Triangle-free subcubic graphs with minimum bipartite density | 2008-04-28 | Paper |
| On the reconstruction of planar graphs | 2007-08-20 | Paper |
| Approximating Longest Cycles in Graphs with Bounded Degrees | 2007-06-26 | Paper |
| Contractible subgraphs ink-connected graphs | 2007-06-11 | Paper |
| Infinite paths in planar graphs IV, dividing cycles | 2007-02-07 | Paper |
| The circumference of a graph with no \(K_{3,t}\)-minor | 2007-01-16 | Paper |
| Contractible cliques in \(k\)-connected graphs | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412151 | 2006-12-05 | Paper |
| Reducing Hajós' 4-coloring conjecture to 4-connected graphs | 2006-07-12 | Paper |
| Finding Four Independent Trees | 2006-06-01 | Paper |
| Nonseparating Planar Chains in 4-Connected Graphs | 2006-06-01 | Paper |
| Chain Decompositions of 4-Connected Graphs | 2006-06-01 | Paper |
| Infinite paths in planar graphs III, 1-way infinite paths | 2006-05-16 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Hamilton paths in toroidal graphs | 2005-08-05 | Paper |
| Infinite paths in planar graphs II, structures and ladder nets | 2005-05-12 | Paper |
| Covering planar graphs with forests | 2005-05-04 | Paper |
| Non-separating paths in 4-connected graphs | 2005-04-28 | Paper |
| Circumference of Graphs with Bounded Degree | 2005-02-21 | Paper |
| Infinite paths in planar graphs I: Graphs with radial nets | 2005-02-16 | Paper |
| Positively curved cubic plane graphs are finite | 2005-02-16 | Paper |
| Cycles in 4-connected planar graphs | 2004-10-04 | Paper |
| Graph connectivity after path removal | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471293 | 2004-07-28 | Paper |
| Hamiltonian knot projections and lengths of thick knots. | 2004-02-03 | Paper |
| Nonseparating Cycles in 4-Connected Graphs | 2004-01-08 | Paper |
| Disjoint paths in graphs. III: Characterization | 2003-09-16 | Paper |
| Disjoint paths in graphs. I: 3-planar graphs and basic obstructions | 2003-08-14 | Paper |
| Disjoint paths in graphs. II: A special case | 2003-08-14 | Paper |
| Hamilton cycles in plane triangulations | 2003-03-19 | Paper |
| Long cycles in 3‐connected graphs in orientable surfaces | 2003-03-19 | Paper |
| Long cycles in 3-connected graphs | 2002-12-10 | Paper |
| A note on fragile graphs | 2002-05-28 | Paper |
| Tutte cycles in circuit graphs | 1998-08-11 | Paper |
| Subdivisions in planar graphs | 1997-09-15 | Paper |
| Convex programming and circumference of 3-connected graphs of low genus | 1997-08-03 | Paper |
| Five-connected toroidal graphs are Hamiltonian | 1997-07-20 | Paper |
| Disjoint paths, planarizing cycles, and spanning walks | 1997-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894619 | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842716 | 1996-04-23 | Paper |
| Non-contractible edges in a 3-connected graph | 1995-10-17 | Paper |
| On hamiltonian‐connected graphs | 1995-06-11 | Paper |
| 3‐connected graphs with non‐cut contractible edge covers of size k | 1995-03-02 | Paper |
| 4-connected projective planar graphs are Hamiltonian | 1994-12-01 | Paper |
| The 3‐connected graphs with a maximum matching containing precisely one contractible edge | 1994-08-29 | Paper |
| Small circuit double covers of cubic multigraphs | 1994-06-06 | Paper |
| Independence ratios of graph powers | 1994-05-05 | Paper |
| Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three | 1993-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033684 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028262 | 1993-03-28 | Paper |
| On 3-connected graphs with contractible edge covers of size \(k\) | 1993-01-16 | Paper |
| Ends in spanning trees | 1993-01-16 | Paper |
| Cyclomatic numbers of connected induced subgraphs | 1993-01-16 | Paper |
| On several symmetry conditions for graphs | 1992-09-27 | Paper |
| On a problem of Hendry | 1992-09-27 | Paper |
| On neighbourhood line graphs | 1992-06-28 | Paper |
| Trees and unicyclic graphs with hamiltonian path graphs | 1992-06-25 | Paper |
| Non-separating cycles and discrete Jordan curves | 1992-01-01 | Paper |
| On the cycle‐isomorphism of graphs | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033794 | 1990-01-01 | Paper |
| Claw‐free graphs are edge reconstructible | 1988-01-01 | Paper |
| A class of trees determined by their chromatic symmetric functions | N/A | Paper |
