Tereza Klimošová

Available identifiers

zbMath Open klimosova.terezaWikidataQ102439078 ScholiaQ102439078MaRDI QIDQ338580

List of research outcomes

Publication	Date of Publication	Type
3-coloring \(C_4\) or \(C_3\)-free diameter two graphs	2024-01-16	Paper
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs	2023-10-31	Paper
Edge‐decomposing graphs into coprime forests	2023-09-29	Paper
Antipaths in oriented graphs	2023-06-12	Paper
Sandwiching biregular random graphs	2023-04-03	Paper
On Vizing's edge colouring question	2023-01-04	Paper
Colouring (P_r+P_s)-Free Graphs	2022-07-21	Paper
Edge-partitioning 3-edge-connected graphs into paths	2022-06-10	Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs	2022-06-08	Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs	2022-06-01	Paper
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs	2021-11-30	Paper
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs	2021-02-16	Paper
A version of the Loebl-Komlós-Sós conjecture for skew trees	2020-06-16	Paper
Colouring \((P_r + P_s)\)-free graphs	2020-05-21	Paper
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs	2019-10-15	Paper
Hereditary properties of permutations are strongly testable	2019-06-20	Paper
Infinite‐dimensional finitely forcible graphon	2019-05-15	Paper
A skew version of the Loebl-Komlós-Sós conjecture	2018-01-18	Paper
Decomposing graphs into paths and trees	2018-01-18	Paper
Densities in large permutations and parameter testing	2016-11-07	Paper
Immersion in four-edge-connected graphs	2015-12-11	Paper
Finitely forcible graphons and permutons	2014-11-21	Paper
Strong Immersions and Maximum Degree	2014-06-19	Paper
Hypertree-depth and minors in hypergraphs	2013-01-07	Paper

Research outcomes over time

This page was built for person: Tereza Klimošová