35 citations · 100 across the 34 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
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…
cs.DM2014★ 5 cited
Ordering without forbidden patterns
Pavol Hell, Bojan Mohar, Arash Rafiey
Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a graph H is a linear ordering of V(H) such that none of…