37 citations · 52 across the 9 of their papers we have counts for
11 papers
Max Point-Tolerance Graphs
Daniele Catanzaro, Steven Chaplick, Stefan Felsner +4
A graph is a \emph{max point-tolerance (MPT)} graph if each vertex of can be mapped to a \emph{pointed-interval} where is an interval of …
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
A. Atminas, R. Brignall, V. Lozin +1
We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bicha…
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm
Mathew Francis, Pavol Hell, Juraj Stacho
A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that…
4-coloring -free graphs with no induced 5-cycles
Maria Chudnovsky, Peter Maceli, Juraj Stacho +1
We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle and no induced 6-vertex path .
Constraint Satisfaction with Counting Quantifiers 2
Barnaby Martin, Juraj Stacho
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers , asserting the existence of distinct witnesses for the variable in q…
On edge-sets of bicliques in graphs
Marina Groshaus, Pavol Hell, Juraj Stacho
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the a…