29 citations · 212 across the 50 of their papers we have counts for
4 papers · 1 filter
Clique-Width: Harnessing the Power of Atoms
Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná +2
Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph…
Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara +3
A graph where each vertex has a list of available colors is -colorable if there is a proper coloring such that the color of is in for each . A graph is…
Packing Directed Cycles Quarter- and Half-Integrally
Tomáš Masařík, Irene Muzi, Marcin Pilipczuk +2
The celebrated Erdős-Pósa theorem states that every undirected graph that does not admit a family of vertex-disjoint cycles contains a feedback vertex set (a set of vertices hi…
Computational complexity of distance edge labeling
Dušan Knop, Tomáš Masařík
The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as labeling) that has been studied for more than twenty years and has many appl…