| Publication | Date of Publication | Type |
|---|
| Sparse critical graphs for defective DP-colorings | 2024-03-27 | Paper |
| Generalized DP-colorings of graphs | 2023-11-27 | Paper |
| Saturation for the 3-uniform loose 3-cycle | 2023-11-27 | Paper |
| Extremal Problems for Hypergraph Blowups of Trees | 2023-10-26 | Paper |
| A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs, II: Large uniformities | 2023-10-19 | Paper |
| Sparse critical graphs for defective $(1,3)$-coloring | 2023-10-12 | Paper |
| Longest cycles in 3‐connected hypergraphs and bipartite graphs | 2023-10-05 | Paper |
| Monochromatic connected matchings in 2‐edge‐colored multipartite graphs | 2023-10-05 | Paper |
| Minimum degree ensuring that a hypergraph is Hamiltonian-connected | 2023-10-02 | Paper |
| Equitable list coloring of planar graphs with given maximum degree | 2023-09-02 | Paper |
| Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable | 2023-08-08 | Paper |
| Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible | 2023-07-19 | Paper |
| Tur\' an number for bushes | 2023-07-10 | Paper |
| Equitable coloring of planar graphs with maximum degree at least eight | 2023-05-19 | Paper |
| \(3\)-reconstructibility of rooted trees | 2023-04-05 | Paper |
| Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree | 2023-03-31 | Paper |
| On a property of $2$-connected graphs and Dirac's Theorem | 2022-12-13 | Paper |
| A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs | 2022-11-23 | Paper |
| Sharp lower bounds for the number of maximum matchings in bipartite multigraphs | 2022-11-18 | Paper |
| Towards the small quasi-kernel conjecture | 2022-10-06 | Paper |
| A characterization of Seymour graphs | 2022-08-30 | Paper |
| Extremal problems for convex geometric hypergraphs and ordered hypergraphs | 2022-01-12 | Paper |
| Defective DP-colorings of sparse simple graphs | 2021-10-27 | Paper |
| Disjoint chorded cycles in graphs with high Ore-degree | 2021-10-04 | Paper |
| On sizes of 1-cross intersecting set pair systems | 2021-09-27 | Paper |
| Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs | 2021-09-26 | Paper |
| Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs | 2021-08-02 | Paper |
| Avoiding long Berge cycles. II: Exact bounds for all \(n\) | 2021-07-23 | Paper |
| On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices | 2021-07-23 | Paper |
| Injective edge-coloring of graphs with given maximum degree | 2021-06-18 | Paper |
| Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable | 2021-03-22 | Paper |
| Cut-edges and regular factors in regular graphs of odd degree | 2021-03-17 | Paper |
| 3-regular graphs are 2-reconstructible | 2021-02-08 | Paper |
| On 2-defective DP-colorings of sparse graphs | 2021-02-08 | Paper |
| Defective DP-colorings of sparse multigraphs | 2021-02-08 | Paper |
| Conditions for a bigraph to be super-cyclic | 2021-01-29 | Paper |
| Tight paths in convex geometric hypergraphs | 2020-10-20 | Paper |
| Partitioning ordered hypergraphs | 2020-10-07 | Paper |
| Super-pancyclic hypergraphs and bipartite graphs | 2020-09-24 | Paper |
| The minimum spectral radius of \(K_{r + 1}\)-saturated graphs | 2020-09-10 | Paper |
| Ordered and convex geometric trees with linear extremal function | 2020-09-01 | Paper |
| On-line DP-coloring of graphs | 2020-08-31 | Paper |
| Berge cycles in non-uniform hypergraphs | 2020-07-30 | Paper |
| $K_{r+1}$-saturated graphs with small spectral radius | 2020-06-08 | Paper |
| Fractional DP‐colorings of sparse graphs | 2020-05-21 | Paper |
| Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices | 2020-04-30 | Paper |
| The minimum number of edges in 4-critical digraphs of given order | 2020-04-30 | Paper |
| Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 | 2020-04-01 | Paper |
| On \(r\)-uniform hypergraphs with circumference less than \(r\) | 2020-04-01 | Paper |
| Long monochromatic paths and cycles in 2-edge-colored multipartite graphs | 2020-02-21 | Paper |
| Extremal union-closed set families | 2020-01-21 | Paper |
| On 2-connected hypergraphs with no long cycles | 2019-11-15 | Paper |
| Hypergraphs Not Containing a Tight Tree with a Bounded Trunk | 2019-08-29 | Paper |
| An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles | 2019-07-25 | Paper |
| Avoiding long Berge cycles | 2019-07-17 | Paper |
| Largest 2-regular subgraphs in 3-regular graphs | 2019-06-28 | Paper |
| A variation of a theorem by Pósa | 2019-06-18 | Paper |
| DP-colorings of hypergraphs | 2019-06-18 | Paper |
| Monochromatic paths and cycles in $2$-edge-colored graphs with large minimum degree | 2019-06-06 | Paper |
| Packing chromatic number of subdivisions of cubic graphs | 2019-05-03 | Paper |
| Cubic graphs with small independence ratio | 2019-03-22 | Paper |
| Many cliques in \(H\)-free subgraphs of random graphs | 2018-12-10 | Paper |
| Extensions of a theorem of Erdős on nonhamiltonian graphs | 2018-10-31 | Paper |
| A Brooks-type result for sparse critical graphs | 2018-09-24 | Paper |
| Sharp Dirac's theorem for DP‐critical graphs | 2018-08-16 | Paper |
| List star edge-coloring of subcubic graphs | 2018-08-10 | Paper |
| Extremal problems on ordered and convex geometric hypergraphs | 2018-07-13 | Paper |
| A Sharp Dirac–Erdős Type Bound for Large Graphs | 2018-04-23 | Paper |
| Cycles in triangle-free graphs of large chromatic number | 2018-04-12 | Paper |
| Stability in the Erdős-Gallai theorem on cycles and paths. II | 2018-04-05 | Paper |
| Sharpening an ore-type version of the Corrádi-Hajnal theorem | 2018-01-05 | Paper |
| Packing chromatic number of cubic graphs | 2017-12-20 | Paper |
| Strong edge-colorings of sparse graphs with large maximum degree | 2017-10-10 | Paper |
| Adding Edges to Increase the Chromatic Number of a Graph | 2017-10-10 | Paper |
| A stability version for a theorem of Erdős on nonhamiltonian graphs | 2017-09-05 | Paper |
| Tight paths in convex geometric hypergraphs | 2017-09-04 | Paper |
| DP-colorings of graphs with high chromatic number | 2017-08-31 | Paper |
| Strengthening Theorems of Dirac and Erdős on Disjoint Cycles | 2017-08-10 | Paper |
| On DP-coloring of graphs and multigraphs | 2017-06-30 | Paper |
| Tight Descriptions of 3‐Paths in Normal Plane Maps | 2017-06-30 | Paper |
| On differences between DP-coloring and list coloring | 2017-05-13 | Paper |
| A refinement of a result of Corrádi and Hajnal | 2017-03-31 | Paper |
| The structure of large intersecting families | 2017-03-27 | Paper |
| On the Corrádi-Hajnal theorem and a question of Dirac | 2016-11-25 | Paper |
| Turán problems and shadows. II: Trees | 2016-11-25 | Paper |
| Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) | 2016-11-25 | Paper |
| Stability in the Erdős-Gallai theorems on cycles and paths | 2016-10-12 | Paper |
| Coloring, sparseness and girth | 2016-09-15 | Paper |
| On a packing problem of Alon and Yuster | 2016-07-05 | Paper |
| Toward Żak's conjecture on graph packing | 2016-05-25 | Paper |
| A list version of graph packing | 2016-05-18 | Paper |
| Ralph Faudree (1938--2015) | 2016-04-27 | Paper |
| Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions | 2016-04-15 | Paper |
| On the number of edges in a graph with no \((k + 1)\)-connected subgraphs | 2015-12-08 | Paper |
| In memory of Dmitriĭ Germanovich Fon-Der-Flaass | 2015-11-16 | Paper |
| Hypergraph Ramsey numbers: triangles versus cliques | 2015-06-19 | Paper |
| Turán Problems and Shadows III: Expansions of Graphs | 2015-06-08 | Paper |
| The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges | 2015-02-18 | Paper |
| Turán problems and shadows. I: Paths and cycles | 2014-11-19 | Paper |
| Ore's conjecture on color-critical graphs is almost true | 2014-10-22 | Paper |
| Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs | 2014-09-04 | Paper |
| Planar 4-critical graphs with four triangles | 2014-09-02 | Paper |
| Ore's conjecture for \(k=4\) and Grötzsch's theorem | 2014-08-14 | Paper |
| Circular \((5,2)\)-coloring of sparse graphs | 2014-06-13 | Paper |
| A new bound on the domination number of connected cubic graphs | 2014-06-13 | Paper |
| Choosability with Separation of Complete Multipartite Graphs and Hypergraphs | 2014-05-28 | Paper |
| Minors in ‐ Chromatic Graphs, II | 2014-05-22 | Paper |
| Decomposition of Cartesian products of regular graphs into isomorphic trees | 2014-05-13 | Paper |
| A new tool for proving Vizing's theorem | 2014-05-06 | Paper |
| On independent sets in hypergraphs | 2014-04-15 | Paper |
| Maximum hypergraphs without regular subgraphs | 2014-04-02 | Paper |
| Short proofs of coloring theorems on planar graphs | 2014-03-25 | Paper |
| Defective 2-colorings of sparse graphs | 2014-02-06 | Paper |
| Describing faces in plane triangulations | 2014-01-27 | Paper |
| On 1-improper 2-coloring of sparse graphs | 2014-01-24 | Paper |
| Describing 3-paths in normal plane maps | 2014-01-24 | Paper |
| Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 | 2014-01-16 | Paper |
| Coloring some finite sets in {R}^{n} | 2013-12-13 | Paper |
| Equitable List Coloring of Graphs with Bounded Degree | 2013-11-15 | Paper |
| Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree | 2013-11-15 | Paper |
| A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge | 2013-10-21 | Paper |
| Coloring Clean and K 4-Free Circle Graphs | 2013-09-25 | Paper |
| A Brooks-type result for sparse critical graphs | 2013-06-14 | Paper |
| On perfect packings in dense graphs | 2013-06-07 | Paper |
| On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs | 2013-03-01 | Paper |
| Packing and covering triangles in \(K_{4}\)-free planar graphs | 2012-12-27 | Paper |
| Graphs containing every 2-factor | 2012-12-27 | Paper |
| On \(K_{s,t}\)-minors in graphs with given average degree. II | 2012-11-20 | Paper |
| Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring | 2012-09-12 | Paper |
| Conflict-Free Colourings of Uniform Hypergraphs With Few Edges | 2012-09-04 | Paper |
| Richard Schelp (1936-2010) | 2012-07-04 | Paper |
| Dense uniform hypergraphs have high list chromatic number | 2012-07-04 | Paper |
| Harmonious coloring of trees with large maximum degree | 2012-05-30 | Paper |
| Large Rainbow Matchings in Edge-Coloured Graphs | 2012-05-14 | Paper |
| A stability theorem on fractional covering of triangles by edges | 2012-05-04 | Paper |
| Large rainbow matchings in large graphs | 2012-04-14 | Paper |
| Graphs with chromatic number close to maximum degree | 2012-04-13 | Paper |
| Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 | 2012-03-07 | Paper |
| Graphs with maximum degree 5 are acyclically 7-colorable | 2012-03-07 | Paper |
| Oriented 5-coloring of sparse plane graphs | 2012-02-10 | Paper |
| Hypergraph list coloring and Euclidean Ramsey theory | 2011-10-25 | Paper |
| Large minors in graphs with given independence number | 2011-10-21 | Paper |
| Minors in Graphs with High Chromatic Number | 2011-08-16 | Paper |
| Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture | 2011-07-22 | Paper |
| Ohba's conjecture for graphs with independence number five | 2011-05-16 | Paper |
| A fast algorithm for equitable coloring | 2011-04-26 | Paper |
| On Ks,t minors in (s+t)-chromatic graphs | 2010-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060863 | 2010-12-13 | Paper |
| Constructions of sparse uniform hypergraphs with high chromatic number | 2010-11-10 | Paper |
| Coloring uniform hypergraphs with few edges | 2010-11-09 | Paper |
| Graphs with bounded tree-width and large odd-girth are almost bipartite | 2010-11-05 | Paper |
| Dense graphs have \(K_{3,t}\) minors | 2010-10-18 | Paper |
| Hadwiger numbers and over-dominating colourings | 2010-10-18 | Paper |
| On a graph packing conjecture by Bollobás, Eldridge and Catlin | 2010-08-13 | Paper |
| Some constructive bounds on Ramsey numbers | 2010-06-03 | Paper |
| Efficient Graph Packing via Game Colouring | 2010-04-22 | Paper |
| Sizes of Induced Subgraphs of Ramsey Graphs | 2010-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656238 | 2010-01-13 | Paper |
| Ore-type conditions implying 2-factors consisting of short cycles | 2009-12-15 | Paper |
| A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs | 2009-12-15 | Paper |
| The Erdős-Lovász tihany conjecture for quasi-line graphs | 2009-12-09 | Paper |
| A list version of Dirac's theorem on the number of edges in colour-critical graphs | 2009-12-08 | Paper |
| Decompositions of quadrangle-free planar graphs | 2009-08-03 | Paper |
| On 2-detour subgraphs of the hypercube | 2009-04-29 | Paper |
| Hadwiger number and the Cartesian product of graphs | 2009-04-29 | Paper |
| Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density | 2009-04-09 | Paper |
| An upper bound on the domination number of \(n\)-vertex connected cubic graphs | 2009-04-09 | Paper |
| On directed triangles in digraphs | 2009-04-07 | Paper |
| Partitions and edge colourings of multigraphs | 2009-04-07 | Paper |
| Adapted List Coloring of Graphs and Hypergraphs | 2009-03-16 | Paper |
| Ore-type versions of Brooks' theorem | 2009-03-04 | Paper |
| Induced subgraphs with distinct sizes | 2009-03-04 | Paper |
| When is an Almost MonochromaticK4Guaranteed? | 2009-03-04 | Paper |
| M-degrees of quadrangle-free planar graphs | 2009-02-20 | Paper |
| Planar graphs decomposable into a forest and a matching | 2009-01-28 | Paper |
| Packing of graphs with small product of sizes | 2008-12-08 | Paper |
| Onk-detour subgraphs of hypercubes | 2008-11-19 | Paper |
| Minimax degrees of quasiplanar graphs with no short cycles other than triangles | 2008-09-29 | Paper |
| Minimum degree conditions for \(H\)-linked graphs | 2008-09-29 | Paper |
| On \(K_{s,t}\)-minors in graphs with given average degree | 2008-09-04 | Paper |
| A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring | 2008-07-21 | Paper |
| Decomposing a planar graph with girth 9 into a forest and a matching | 2008-05-29 | Paper |
| Ore‐type degree conditions for a graph to be H‐linked | 2008-05-14 | Paper |
| Minimax degrees of quasiplane graphs without 4-faces | 2008-04-14 | Paper |
| Packing \(d\)-degenerate graphs | 2007-12-10 | Paper |
| An Ore-type theorem on equitable coloring | 2007-12-10 | Paper |
| On Minimum Degree Implying That a Graph is H‐Linked | 2007-11-16 | Paper |
| An Ore-type analogue of the Sauer-Spencer theorem | 2007-10-11 | Paper |
| Minimum degree conditions for H-linked graphs | 2007-05-29 | Paper |
| Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer | 2007-05-15 | Paper |
| Tree representations of graphs | 2007-04-10 | Paper |
| Ore-type graph packing problems | 2007-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424880 | 2007-03-05 | Paper |
| On Ramsey numbers of uniform hypergraphs with given maximum degree | 2006-12-07 | Paper |
| On Sufficient Degree Conditions for a Graph to be $k$-linked | 2006-12-05 | Paper |
| Chvátal's Condition cannot hold for both a graph and its complement | 2006-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477816 | 2006-06-29 | Paper |
| Dominating sets in \(k\)-majority tournaments. | 2006-05-18 | Paper |
| On equitable \(\Delta\)-coloring of graphs with low average degree | 2006-03-20 | Paper |
| On domination in connected cubic graphs | 2005-12-29 | Paper |
| Nordhaus–Gaddum‐type Theorems for decompositions into many parts | 2005-12-08 | Paper |
| An extremal problem for H‐linked graphs | 2005-12-08 | Paper |
| On Two Conjectures on Packing of Graphs | 2005-11-14 | Paper |
| Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders | 2005-09-29 | Paper |
| Precoloring Extensions of Brooks' Theorem | 2005-09-16 | Paper |
| On Equitable Coloring of d-Degenerate Graphs | 2005-09-16 | Paper |
| On graphs with small Ramsey numbers. II. | 2005-07-05 | Paper |
| Even cycles in hypergraphs | 2005-05-04 | Paper |
| Smaller planar triangle-free graphs that are not 3-list-colorable | 2005-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657585 | 2005-03-14 | Paper |
| Disjoint \(K_{r}\)-minors in large graphs with given average degree | 2005-03-08 | Paper |
| On Ramsey Numbers of Sparse Graphs | 2005-03-08 | Paper |
| On the chromatic number of intersection graphs of convex sets in the plane | 2004-10-13 | Paper |
| Decomposing graphs into long paths | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471329 | 2004-07-28 | Paper |
| Balanced edge colorings. | 2004-03-15 | Paper |
| Homomorphisms from sparse graphs with large girth. | 2004-03-15 | Paper |
| Coloring uniform hypergraphs with few colors | 2004-02-03 | Paper |
| A list analogue of equitable coloring | 2004-02-03 | Paper |
| A new lower bound on the number of edges in colour-critical graphs and hypergraphs | 2003-08-25 | Paper |
| Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces | 2003-06-15 | Paper |
| Equitable Colourings of d-degenerate Graphs | 2003-06-13 | Paper |
| Degree conditions for k‐ordered hamiltonian graphs | 2003-04-03 | Paper |
| Local and mean Ramsey numbers for trees | 2002-12-10 | Paper |
| Vertex set partitions preserving conservativeness | 2002-12-10 | Paper |
| On deeply critical oriented graphs | 2002-12-10 | Paper |
| Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\) | 2002-12-10 | Paper |
| Equitable colorings of outerplanar graphs | 2002-12-02 | Paper |
| Acyclic colouring of 1-planar graphs | 2002-11-06 | Paper |
| Transversals in uniform hypergraphs with property \((p,2)\) | 2002-11-03 | Paper |
| On graphs with small Ramsey numbers* | 2002-10-01 | Paper |
| On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs | 2002-09-22 | Paper |
| On nice graphs | 2002-08-08 | Paper |
| Colouring relatives of intervals on the plane. II: Intervals and rays in two directions | 2002-08-07 | Paper |
| Acyclic list 7‐coloring of planar graphs | 2002-07-11 | Paper |
| Total choosability of multicircuits I | 2002-07-01 | Paper |
| Total choosability of multicircuits II | 2002-07-01 | Paper |
| Density conditions for panchromatic colourings of hypergraphs | 2002-06-25 | Paper |
| The pagenumber of spherical lattices is unbounded | 2002-05-21 | Paper |
| Sparse sets in the complements of graphs with given girth | 2002-04-16 | Paper |
| Colorings and homomorphisms of degenerate and bounded degree graphs | 2002-04-16 | Paper |
| Choosability conjectures and multicircuits | 2002-04-09 | Paper |
| On the chromatic number of set systems | 2002-02-10 | Paper |
| The number of q-ary words with restrictions on the length of the maximal run | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945060 | 2001-07-16 | Paper |
| On the number of edges in colour-critical graphs and hypergraphs | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949848 | 2001-02-20 | Paper |
| Colouring triangle-free intersection graphs of boxes on the plane | 2000-12-03 | Paper |
| Variable degeneracy: Extensions of Brooks' and Gallai's theorems | 2000-12-03 | Paper |
| On universal graphs for planar oriented graphs of a given girth | 2000-11-02 | Paper |
| On the independent domination number of graphs with given minimum degree | 2000-11-02 | Paper |
| Colour-critical graphs with few edges | 2000-11-02 | Paper |
| On kernel-perfect orientations of line graphs | 2000-11-02 | Paper |
| The dimension of interior levels of the Boolean lattice. II | 2000-10-22 | Paper |
| Acyclic \(k\)-strong coloring of maps on surfaces | 2000-10-16 | Paper |
| On the Hajós number of graphs | 2000-09-27 | Paper |
| Acyclic Colourings of Planar Graphs with Large Girth | 2000-07-04 | Paper |
| On the number of edges in hypergraphs critical with respect to strong colourings | 2000-06-29 | Paper |
| On degrees of vertices in paradoxical trees | 2000-06-07 | Paper |
| Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs | 2000-05-04 | Paper |
| Transversals in uniform hypergraphs with property (7, 2) | 2000-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936748 | 2000-01-31 | Paper |
| Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number | 2000-01-30 | Paper |
| On Systems of Small Sets with No Large Δ-Subsystems | 2000-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250145 | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705347 | 1999-12-19 | Paper |
| On the maximum average degree and the oriented chromatic number of a graph | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263475 | 1999-11-21 | Paper |
| Hypercube subgraphs with local detours | 1999-06-06 | Paper |
| On large systems of sets with no large weak \(\Delta\)-subsystems | 1999-05-18 | Paper |
| The dimension of neighboring levels of the Boolean lattice | 1999-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209045 | 1998-10-04 | Paper |
| Total colourings of planar graphs with large girth | 1998-04-07 | Paper |
| Coloring relatives of intervals on the plane. I: Chromatic number versus girth | 1998-04-07 | Paper |
| Intersection statements for systems of sets | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337507 | 1997-10-26 | Paper |
| Acyclic and oriented chromatic numbers of graphs | 1997-10-20 | Paper |
| Graphs without short odd cycles are nearly bipartite | 1997-09-24 | Paper |
| Covering and coloring polygon-circle graphs | 1997-09-24 | Paper |
| The colour theorems of Brooks and Gallai extended | 1997-09-24 | Paper |
| Total colorings of planar graphs with large maximum degree | 1997-09-17 | Paper |
| List edge and list total colourings of multigraphs | 1997-09-15 | Paper |
| A characterization of Seymour graphs | 1997-08-31 | Paper |
| The total chromatic number of any multigraph with maximum degree five is at most seven | 1997-06-10 | Paper |
| An intersection theorem for systems of sets | 1997-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689011 | 1997-03-11 | Paper |
| Small transversals in uniform hypergraphs | 1996-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852858 | 1996-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866337 | 1996-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852859 | 1996-02-20 | Paper |
| The number of spanning trees in graphs with a given degree sequence | 1995-08-27 | Paper |
| On set systems without weak 3-\(\Delta\)-subsystems | 1995-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318219 | 1995-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321509 | 1995-02-19 | Paper |
| The 7/5‐conjecture strengthens itself | 1995-02-01 | Paper |
| The dimension of suborders of the Boolean lattice | 1994-11-27 | Paper |
| The dimension of interior levels of the Boolean lattice | 1994-11-10 | Paper |
| On the number of connected subgraphs with small edge‐boundary in regular graphs | 1994-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3364277 | 1994-01-01 | Paper |
| Covering boxes by points | 1993-11-01 | Paper |
| The independent domination number of a cubic 3-connected graph can be much larger than its domination number | 1993-10-28 | Paper |
| Radius and diameter of random subgraphs of the hypercube | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027167 | 1993-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027168 | 1993-02-21 | Paper |
| List edge chromatic number of graphs with large girth | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983324 | 1992-06-27 | Paper |
| An upper bound of the cardinality of antichain boundary in the n-cube | 1992-06-25 | Paper |
| Matchings in random spanning subgraphs of cubelike graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4713810 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3364155 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348945 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360863 | 1990-01-01 | Paper |
| Locally Hamiltonian graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820631 | 1989-01-01 | Paper |
| Small topological complete subgraphs of ``dense graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832590 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835491 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809816 | 1987-01-01 | Paper |
| On the minimum of the Hadwiger number for graphs with a given mean degree of vertices | 1986-01-01 | Paper |
| Maximum set of edges no two covered by a clique | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781136 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804726 | 1985-01-01 | Paper |
| Lower bound of the Hadwiger number of graphs by their average degree | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3699719 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3701447 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309861 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329496 | 1983-01-01 | Paper |
| A class of constructions for Turan's (3,4)-problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3333070 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3909076 | 1980-01-01 | Paper |
| On a problem of G. O. H. Katona and T. Tarján | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4163548 | 1978-01-01 | Paper |
| On an upper bound of the graph's chromatic number, depending on the graph's degree and density | 1977-01-01 | Paper |
| The total coloring of a multigraph with maximal degree 4 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858290 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858291 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168627 | 1977-01-01 | Paper |
| Note to the paper of Grünbaum on acyclic colorings | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200238 | 1976-01-01 | Paper |
| Minimal abundant packings and choosability with separation | 0001-01-03 | Paper |
| Sharp lower bounds for the number of maximum matchings in bipartite multigraphs | 0001-01-03 | Paper |
| A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs | 0001-01-03 | Paper |
