The following pages link to Tereza Klimošová (Q338580):
Displaying 22 items.
- Densities in large permutations and parameter testing (Q338581) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- Immersion in four-edge-connected graphs (Q895999) (← links)
- A skew version of the Loebl-Komlós-Sós conjecture (Q1690002) (← links)
- Decomposing graphs into paths and trees (Q1690003) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Counterexamples to Thomassen's conjecture on decomposition of cubic graphs (Q2053720) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- A version of the Loebl-Komlós-Sós conjecture for skew trees (Q2189826) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Strong Immersions and Maximum Degree (Q4979833) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs (Q5236261) (← links)
- Hereditary properties of permutations are strongly testable (Q5384048) (← links)
- Infinite‐dimensional finitely forcible graphon (Q5741849) (← links)
- Sandwiching biregular random graphs (Q5885183) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
- Antipaths in oriented graphs (Q6098098) (← links)
