8 citations · 16 across the 10 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 1 cited
Small H-coloring problems for bounded degree digraphs
Aurosish Mishra, Pavol Hell
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the…
cs.DM2012
Obstructions to chordal circular-arc graphs of small independence number
Mathew Francis, Pavol Hell, Juraj Stacho
A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining t…