Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q6147290 | 2024-01-15 | Paper |
Large cliques in graphs with high chromatic number | 2023-11-27 | Paper |
A note on \(\Delta\)-critical graphs | 2023-11-07 | Paper |
Algorithms for Weighted Independent Transversals and Strong Colouring | 2023-10-31 | Paper |
Finding independent transversals efficiently | 2021-04-30 | Paper |
Topological connectedness and independent sets in graphs | 2021-02-06 | Paper |
Goldberg's conjecture is true for random multigraphs | 2019-07-17 | Paper |
Morphing Schnyder drawings of planar triangulations | 2019-04-25 | Paper |
A Stability Theorem for Matchings in Tripartite 3-Graphs | 2018-11-05 | Paper |
Extremal hypergraphs for Ryser's conjecture | 2018-07-18 | Paper |
Ramsey-nice families of graphs | 2018-06-28 | Paper |
Homological connectedness of random hypergraphs | 2018-01-18 | Paper |
A note on intersecting hypergraphs with large cover number | 2017-09-08 | Paper |
On Lower Bounds for the Matching Number of Subcubic Graphs | 2017-07-05 | Paper |
How to Morph Planar Graph Drawings | 2017-05-30 | Paper |
Independent transversals and hypergraph matchings - an elementary approach | 2017-01-25 | Paper |
Edge coloring multigraphs without small dense subsets | 2015-08-05 | Paper |
Morphing Schnyder drawings of planar triangulations | 2015-01-07 | Paper |
Packing and covering tetrahedra | 2013-11-29 | Paper |
Primality of trees | 2013-07-30 | Paper |
Tree-minimal graphs are almost regular | 2013-07-12 | Paper |
Packing and covering triangles in \(K_{4}\)-free planar graphs | 2012-12-27 | Paper |
Bounded transversals in multipartite graphs | 2012-07-10 | Paper |
On Ryser's conjecture | 2012-06-12 | Paper |
On Even-Degree Subgraphs of Linear Hypergraphs | 2012-05-14 | Paper |
A stability theorem on fractional covering of triangles by edges | 2012-05-04 | Paper |
On characterizing Vizing's edge colouring bound | 2012-02-08 | Paper |
On Forming Committees | 2011-11-21 | Paper |
A note on Schnyder's theorem | 2011-08-16 | Paper |
On the Stable Paths Problem | 2011-06-17 | Paper |
List coloring hypergraphs | 2010-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579394 | 2010-08-06 | Paper |
Packing and covering triangles in planar graphs | 2010-05-05 | Paper |
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles | 2010-04-23 | Paper |
Large monochromatic components in colorings of complete 3-uniform hypergraphs | 2009-06-23 | Paper |
On directed triangles in digraphs | 2009-04-07 | Paper |
An Algorithmic Version of the Hypergraph Regularity Method | 2008-12-22 | Paper |
An improved bound for the strong chromatic number | 2008-06-12 | Paper |
Maximum acyclic and fragmented sets in regular graphs | 2008-02-13 | Paper |
Integer and fractional packings in dense graphs | 2007-03-29 | Paper |
Independent dominating sets and hamiltonian cycles | 2007-03-20 | Paper |
The Ramsey number for hypergraph cycles. I. | 2006-03-16 | Paper |
Odd Independent Transversals are Odd | 2006-03-13 | Paper |
A note on the Size-Ramsey number of long subdivisions of graphs | 2005-06-07 | Paper |
On the Strong Chromatic Number | 2005-02-18 | Paper |
To Adrian Bondy and U.S.R. Murty. | 2004-03-15 | Paper |
Bounded size components -- partitions and transversals. | 2003-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4411389 | 2003-07-08 | Paper |
Integer and fractional packings in dense 3‐uniform hypergraphs | 2003-05-11 | Paper |
A note on cycle lengths in graphs | 2003-03-25 | Paper |
On characterizing hypergraph regularity | 2003-03-19 | Paper |
Ramsey numbers for trees of small maximum degree | 2002-11-03 | Paper |
A Note on Vertex List Colouring | 2002-06-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2712588 | 2001-08-27 | Paper |
Embedding trees into graphs of large girth | 2001-03-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4518333 | 2001-03-04 | Paper |
Packing and covering triangles in graphs | 2000-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4370210 | 1999-04-25 | Paper |
Packing and covering triangles in tripartite graphs | 1998-09-06 | Paper |
Partitioning complete bipartite graphs by monochromatic cycles | 1997-08-03 | Paper |
Hypercubes and Multicommodity Flows | 1997-05-26 | Paper |
Partitioning by monochromatic trees | 1997-02-23 | Paper |
Atoms of set systems with a fixed number of pairwise unions | 1996-07-02 | Paper |
The Induced Size-Ramsey Number of Cycles | 1996-06-18 | Paper |
Turán's extremal problem in random graphs: Forbidding odd cycles | 1996-05-14 | Paper |
On an anti‐Ramsey property of Ramanujan graphs | 1996-01-28 | Paper |
Turán's extremal problem in random graphs: Forbidding even cycles | 1995-12-18 | Paper |
A condition for matchability in hypergraphs | 1995-10-31 | Paper |
A note on a conjecture of Gallai | 1995-10-08 | Paper |
The size-Ramsey number of trees | 1995-10-05 | Paper |
A note on a conjecture of Ryser | 1995-07-02 | Paper |
Counting interval orders | 1987-01-01 | Paper |