Tereza Klimošová

From MaRDI portal
Person:338580

Available identifiers

zbMath Open klimosova.terezaWikidataQ102439078 ScholiaQ102439078MaRDI QIDQ338580

List of research outcomes

PublicationDate of PublicationType
3-coloring \(C_4\) or \(C_3\)-free diameter two graphs2024-01-16Paper
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs2023-10-31Paper
Edge‐decomposing graphs into coprime forests2023-09-29Paper
Antipaths in oriented graphs2023-06-12Paper
Sandwiching biregular random graphs2023-04-03Paper
On Vizing's edge colouring question2023-01-04Paper
Colouring (P_r+P_s)-Free Graphs2022-07-21Paper
Edge-partitioning 3-edge-connected graphs into paths2022-06-10Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs2022-06-08Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs2022-06-01Paper
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs2021-11-30Paper
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs2021-02-16Paper
A version of the Loebl-Komlós-Sós conjecture for skew trees2020-06-16Paper
Colouring \((P_r + P_s)\)-free graphs2020-05-21Paper
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs2019-10-15Paper
Hereditary properties of permutations are strongly testable2019-06-20Paper
Infinite‐dimensional finitely forcible graphon2019-05-15Paper
A skew version of the Loebl-Komlós-Sós conjecture2018-01-18Paper
Decomposing graphs into paths and trees2018-01-18Paper
Densities in large permutations and parameter testing2016-11-07Paper
Immersion in four-edge-connected graphs2015-12-11Paper
Finitely forcible graphons and permutons2014-11-21Paper
Strong Immersions and Maximum Degree2014-06-19Paper
Hypertree-depth and minors in hypergraphs2013-01-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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