Publication | Date of Publication | Type |
---|
Hypergraph Turán Problems in l2-Norm | 2024-01-05 | Paper |
C5 ${C}_{5}$ is almost a fractalizer | 2023-10-10 | Paper |
Coloring count cones of planar graphs | 2023-10-05 | Paper |
Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm | 2023-08-21 | Paper |
The Spectrum of Triangle-Free Graphs | 2023-06-22 | Paper |
On tripartite common graphs | 2023-03-31 | Paper |
Making Kr+1-free graphs r-partite | 2023-03-30 | Paper |
Shortened universal cycles for permutations | 2022-11-11 | Paper |
On weak flexibility in planar graphs | 2022-11-04 | Paper |
Planar Turán numbers of cycles: a counterexample | 2022-09-06 | Paper |
Counterexamples to a Conjecture of Harris on Hall Ratio | 2022-07-28 | Paper |
Maximum number of almost similar triangles in the plane | 2022-06-13 | Paper |
Semidefinite Programming and Ramsey Numbers | 2021-11-04 | Paper |
Maximizing five-cycles in \(K_r\)-free graphs | 2021-08-05 | Paper |
Sharp bounds for decomposing graphs into edges and triangles | 2021-06-15 | Paper |
Inducibility of directed paths | 2020-08-12 | Paper |
Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets | 2020-05-21 | Paper |
Decomposing Graphs into Edges and Triangles | 2020-04-06 | Paper |
Minimizing the number of 5-cycles in graphs with given edge-density | 2020-04-06 | Paper |
Closing in on Hill's Conjecture | 2019-08-29 | Paper |
Facial unique-maximum colorings of plane graphs with restriction on big vertices | 2019-07-18 | Paper |
Partition problems in high dimensional boxes | 2019-06-28 | Paper |
Irreversible 2-conversion set in graphs of bounded degree | 2018-12-10 | Paper |
Pentagons in triangle-free graphs | 2018-09-07 | Paper |
On the strong chromatic index of sparse graphs | 2018-08-15 | Paper |
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains | 2018-07-25 | Paper |
Notes on complexity of packing coloring | 2018-06-15 | Paper |
Independent sets near the lower bound in bounded degree graphs | 2018-04-19 | Paper |
On facial unique-maximum (edge-)coloring | 2018-02-22 | Paper |
A counterexample to a conjecture on facial unique-maximal colorings | 2018-02-22 | Paper |
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces | 2018-01-12 | Paper |
3-coloring triangle-free planar graphs with a precolored 9-cycle | 2017-11-14 | Paper |
\((4,2)\)-choosability of planar graphs with forbidden structures | 2017-10-11 | Paper |
Minimum Number of Monotone Subsequences of Length 4 in Permutations | 2017-10-04 | Paper |
Injective choosability of subcubic planar graphs with girth 6 | 2017-08-01 | Paper |
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles | 2017-05-24 | Paper |
5-choosability of graphs with crossings far apart | 2017-01-26 | Paper |
5-list-coloring planar graphs with distant precolored vertices | 2016-11-25 | Paper |
On the Tree Search Problem with Non-uniform Costs | 2016-10-21 | Paper |
On the tree search problem with non-uniform costs | 2016-09-01 | Paper |
Rainbow copies of \(C_4\) in edge-colored hypercubes | 2016-06-22 | Paper |
On Choosability with Separation of Planar Graphs with Forbidden Cycles | 2016-04-15 | Paper |
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle | 2015-12-11 | Paper |
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle | 2015-09-29 | Paper |
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle | 2015-09-15 | Paper |
On choosability with separation of planar graphs with lists of different sizes | 2015-06-01 | Paper |
Planar 4-critical graphs with four triangles | 2014-09-02 | Paper |
On the Turán number of forests | 2014-08-14 | Paper |
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube | 2014-07-29 | Paper |
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles | 2014-06-19 | Paper |
Short proofs of coloring theorems on planar graphs | 2014-03-25 | Paper |
Peeling the Grid | 2013-09-26 | Paper |
The planar slope number of planar partial 3-trees of bounded degree | 2013-07-19 | Paper |
Six-Critical Graphs on the Klein Bottle | 2013-06-28 | Paper |
Finding vertex-surjective graph homomorphisms | 2012-10-15 | Paper |
Finding Vertex-Surjective Graph Homomorphisms | 2012-09-10 | Paper |
Bipartizing fullerenes | 2012-06-18 | Paper |
Distance three labelings of trees | 2012-05-11 | Paper |
Packing chromatic number of distance graphs | 2012-05-04 | Paper |
The \(k\)-in-a-path problem for claw-free graphs | 2012-04-26 | Paper |
Graphs with Two Crossings Are 5-Choosable | 2012-03-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3113764 | 2012-01-23 | Paper |
5-Coloring Graphs with 4 Crossings | 2011-10-27 | Paper |
Locally Injective Homomorphism to the Simple Weight Graphs | 2011-07-01 | Paper |
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles | 2011-06-17 | Paper |
Complexity of Locally Injective Homomorphism to the Theta Graphs | 2011-05-19 | Paper |
Short Cycle Covers of Graphs with Minimum Degree Three | 2011-03-15 | Paper |
Randić index and the diameter of a graph | 2011-03-04 | Paper |
L(2,1,1)-Labeling Is NP-Complete for Trees | 2010-06-17 | Paper |
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree | 2010-04-27 | Paper |
6-Critical Graphs on the Klein Bottle | 2010-03-17 | Paper |
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable | 2009-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3635511 | 2009-07-06 | Paper |
The packing chromatic number of infinite product graphs | 2009-06-17 | Paper |
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters | 2009-03-03 | Paper |