22 results on '"Klimošová, Tereza"'
Search Results
2. Antipaths in oriented graphs
3. Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
4. On Vizing's edge colouring question
5. Edge-partitioning 3-edge-connected graphs into paths
6. Sandwiching biregular random graphs
7. On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs
8. Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
9. Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs
10. Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs
11. Edge‐decomposing graphs into coprime forests
12. A version of the Loebl–Komlós–Sós conjecture for skew trees
13. Colouring (Pr + Ps)-Free Graphs
14. Infinite‐dimensional finitely forcible graphon
15. A skew version of the Loebl–Komlós–Sós conjecture
16. Decomposing graphs into paths and trees
17. Densities in large permutations and parameter testing
18. Immersion in four-edge-connected graphs
19. Finitely forcible graphons and permutons
20. Strong Immersions and Maximum Degree
21. Hereditary properties of permutations are strongly testable
22. Hypertree-depth and minors in hypergraphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.