Tereza Klimošová

activity

20122023

(P_{r} + P_{s})

-Free Graphs

14 citations · 26 across the 13 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2023

3-Coloring $C_{4}$ or $C_{3}$ -free Diameter Two Graphs

Tereza Klimošová, Vibha Sahlot

The question of whether 3-Coloring can be solved in polynomial-time for the diameter two graphs is a well-known open problem in the area of algorithmic graph theory. We study the p…

cs.DS2018★ 14 cited

Colouring $(P_{r} + P_{s})$ -Free Graphs

Tereza Klimošová, Josef Malík, Tomáš Masařík +3

The $k$ -Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for a fixed integer $k$ such that no two adjacent vertices are coloured a…

cs.DS2017

Polynomial-time algorithm for Maximum Weight Independent Set on $P_{6}$ -free graphs

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk +1

In the classic Maximum Weight Independent Set problem we are given a graph $G$ with a nonnegative weight function on vertices, and the goal is to find an independent set in $G$ of…

3-Coloring C4​ or C3​-free Diameter Two Graphs

Colouring (Pr​+Ps​)-Free Graphs

Polynomial-time algorithm for Maximum Weight Independent Set on P6​-free graphs

3-Coloring $C_{4}$ or $C_{3}$ -free Diameter Two Graphs

Colouring $(P_{r} + P_{s})$ -Free Graphs

Polynomial-time algorithm for Maximum Weight Independent Set on $P_{6}$ -free graphs