13 citations · 22 across the 13 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Edge-decomposition into Two Triangular Forests is NP-complete
Beniamin Bibrowski, Tomáš Masařík
Let be a graph class that is closed under topological minors and 1-sums, has decidable membership, contains a triangle, and is not the class of all graphs. Recently, L…
cs.CC2025
Constricting the Computational Complexity Gap of the -Coloring Problem in -free Graphs
Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík +1
The -Coloring problem on hereditary graph classes has been a deeply researched problem over the last decade. A hereditary graph class is characterized by a (possibly infinite) l…
cs.CC2018
Parameterized Complexity of Fair Vertex Evaluation Problems
Dušan Knop, Tomáš Masařík, Tomáš Toufar
A prototypical graph problem is centered around a graph-theoretic property for a set of vertices and a solution to it is a set of vertices for which the desired property holds. The…