Bernard Lidický

From MaRDI portal
Person:299041

Available identifiers

zbMath Open lidicky.bernardWikidataQ102079682 ScholiaQ102079682MaRDI QIDQ299041

List of research outcomes





PublicationDate of PublicationType
Sharp bounds for decomposing graphs into edges and triangles2024-10-18Paper
10 problems for partitions of triangle-free graphs2024-09-30Paper
Relaxation of Wegner's planar graph conjecture for maximum degree 42024-09-26Paper
Hypergraph Turán Problems in l2-Norm2024-01-05Paper
C5 ${C}_{5}$ is almost a fractalizer2023-10-10Paper
Coloring count cones of planar graphs2023-10-05Paper
Decomposing random regular graphs into stars2023-08-30Paper
Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm2023-08-21Paper
The Spectrum of Triangle-Free Graphs2023-06-22Paper
On tripartite common graphs2023-03-31Paper
Making Kr+1-free graphs r-partite2023-03-30Paper
Embedded graph 3-coloring and flows2023-03-09Paper
Weighted Tur\'an theorems with applications to Ramsey-Tur\'an type of problems2023-02-15Paper
Relaxation of Wegner's Planar Graph Conjecture for maximum degree 42022-12-20Paper
Shortened universal cycles for permutations2022-11-11Paper
On weak flexibility in planar graphs2022-11-04Paper
Nearly all $k$-SAT functions are unate2022-09-11Paper
Planar Turán numbers of cycles: a counterexample2022-09-06Paper
Counterexamples to a Conjecture of Harris on Hall Ratio2022-07-28Paper
Maximum number of almost similar triangles in the plane2022-06-13Paper
11/4-colorability of subcubic triangle-free graphs2022-04-26Paper
10 Problems for Partitions of Triangle-free Graphs2022-03-29Paper
Semidefinite Programming and Ramsey Numbers2021-11-04Paper
Maximizing five-cycles in \(K_r\)-free graphs2021-08-05Paper
Sharp bounds for decomposing graphs into edges and triangles2021-06-15Paper
Max Cuts in Triangle-free Graphs2021-03-25Paper
Inducibility of 4-vertex tournaments2021-03-11Paper
Inducibility of directed paths2020-08-12Paper
Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets2020-05-21Paper
Decomposing Graphs into Edges and Triangles2020-04-06Paper
Minimizing the number of 5-cycles in graphs with given edge-density2020-04-06Paper
Making $K_{r+1}$-Free Graphs $r$-partite2019-09-30Paper
Closing in on Hill's Conjecture2019-08-29Paper
Facial unique-maximum colorings of plane graphs with restriction on big vertices2019-07-18Paper
Partition problems in high dimensional boxes2019-06-28Paper
Irreversible 2-conversion set in graphs of bounded degree2018-12-10Paper
Pentagons in triangle-free graphs2018-09-07Paper
On the strong chromatic index of sparse graphs2018-08-15Paper
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains2018-07-25Paper
Notes on complexity of packing coloring2018-06-15Paper
Independent sets near the lower bound in bounded degree graphs2018-04-19Paper
On facial unique-maximum (edge-)coloring2018-02-22Paper
A counterexample to a conjecture on facial unique-maximal colorings2018-02-22Paper
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces2018-01-12Paper
3-coloring triangle-free planar graphs with a precolored 9-cycle2017-11-14Paper
\((4,2)\)-choosability of planar graphs with forbidden structures2017-10-11Paper
Minimum Number of Monotone Subsequences of Length 4 in Permutations2017-10-04Paper
Injective choosability of subcubic planar graphs with girth 62017-08-01Paper
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles2017-05-24Paper
5-choosability of graphs with crossings far apart2017-01-26Paper
5-list-coloring planar graphs with distant precolored vertices2016-11-25Paper
On the Tree Search Problem with Non-uniform Costs2016-10-21Paper
On the tree search problem with non-uniform costs2016-09-01Paper
Rainbow copies of \(C_4\) in edge-colored hypercubes2016-06-22Paper
On choosability with separation of planar graphs with forbidden cycles2016-04-15Paper
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle2015-12-11Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-29Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-15Paper
On choosability with separation of planar graphs with lists of different sizes2015-06-01Paper
Planar 4-critical graphs with four triangles2014-09-02Paper
On the Turán number of forests2014-08-14Paper
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube2014-07-29Paper
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles2014-06-19Paper
Short proofs of coloring theorems on planar graphs2014-03-25Paper
Peeling the grid2013-09-26Paper
The planar slope number of planar partial 3-trees of bounded degree2013-07-19Paper
Six-Critical Graphs on the Klein Bottle2013-06-28Paper
Finding vertex-surjective graph homomorphisms2012-10-15Paper
Finding Vertex-Surjective Graph Homomorphisms2012-09-10Paper
Bipartizing fullerenes2012-06-18Paper
Distance three labelings of trees2012-05-11Paper
Packing chromatic number of distance graphs2012-05-04Paper
The \(k\)-in-a-path problem for claw-free graphs2012-04-26Paper
Graphs with Two Crossings Are 5-Choosable2012-03-15Paper
https://portal.mardi4nfdi.de/entity/Q31137642012-01-23Paper
5-Coloring Graphs with 4 Crossings2011-10-27Paper
Locally Injective Homomorphism to the Simple Weight Graphs2011-07-01Paper
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles2011-06-17Paper
Complexity of Locally Injective Homomorphism to the Theta Graphs2011-05-19Paper
Short Cycle Covers of Graphs with Minimum Degree Three2011-03-15Paper
Randić index and the diameter of a graph2011-03-04Paper
L(2,1,1)-Labeling Is NP-Complete for Trees2010-06-17Paper
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree2010-04-27Paper
6-Critical Graphs on the Klein Bottle2010-03-17Paper
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable2009-12-15Paper
https://portal.mardi4nfdi.de/entity/Q36355112009-07-06Paper
The packing chromatic number of infinite product graphs2009-06-17Paper
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters2009-03-03Paper
Triangle Percolation on the GridN/APaper
Proper Rainbow Saturation Numbers for CyclesN/APaper

Research outcomes over time

This page was built for person: Bernard Lidický