The following pages link to Daniel Král' (Q273100):
Displaying 50 items.
- A bound on the inducibility of cycles (Q1621427) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- The step Sidorenko property and non-norming edge-transitive graphs (Q1633367) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
- Walk entropy and walk-regularity (Q1743135) (← links)
- A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- Cyclic, diagonal and facial colorings (Q1767632) (← links)
- Remarks on hyperenergetic circulant graphs (Q1779274) (← links)
- On distance matrices and Laplacians (Q1779393) (← links)
- Graphs with special arcs and cryptography (Q1862260) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- Mixed hypercacti (Q1883259) (← links)
- Borodin's conjecture on diagonal coloring is false (Q1883292) (← links)
- On feasible sets of mixed hypergraphs (Q1883629) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Hajós' theorem for list coloring (Q1886360) (← links)
- Pancyclicity of strong products of graphs (Q1889847) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- Coloring graphs by translates in the circle (Q2033887) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Packing and covering directed triangles asymptotically (Q2065998) (← links)
- Density maximizers of layered permutations (Q2088699) (← links)
- Cycles of a given length in tournaments (Q2099412) (← links)
- No additional tournaments are quasirandom-forcing (Q2107498) (← links)
- Non-bipartite \(k\)-common graphs (Q2151175) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Rank of divisors on tropical curves (Q2349185) (← links)
- Cyclic, diagonal and facial colorings -- a missing case (Q2372426) (← links)
- Quasirandom permutations are characterized by 4-point densities (Q2375768) (← links)
- A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) (Q2380208) (← links)
- Chromatic number for a generalization of Cartesian product graphs (Q2380225) (← links)
- Pattern hypergraphs (Q2380447) (← links)
- Geodesic-pancyclic graphs (Q2381818) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- Triangles in arrangements of points and lines in the plane (Q2431273) (← links)
- Decomposition of complete graphs into small generalized prisms (Q2443423) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\) (Q2506164) (← links)
- The fractional chromatic number of triangle-free subcubic graphs (Q2509748) (← links)
- Projective, affine, and abelian colorings of cubic graphs (Q2519796) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Extending partial 5-colorings and 6-colorings in planar graphs (Q2581502) (← links)
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size (Q2581629) (← links)
