13 citations · 77 across the 56 of their papers we have counts for
Showing 2023 · cs.DMShow all
3 papers · 2 filters
cs.DM2023
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters
Carla Groenland, Isja Mannens, Jesper Nederlof +2
A homomorphism from a graph to a graph is an edge-preserving mapping from to . In the graph homomorphism problem, denoted by , the graph is fixed a…
cs.DM2023
A polynomial bound on the number of minimal separators and potential maximal cliques in -free graphs of bounded clique number
Marcin Pilipczuk, Paweł Rzążewski
In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in -free graphs of bounded clique number.
cs.DM2023
Coloring and Recognizing Directed Interval Graphs
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen +3
A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particul…