35 citations · 100 across the 34 of their papers we have counts for
39 papers
Full homomorphisms to graph classes
Pavol Hell, César Hernández-Cruz
Given a family of graphs , we define a graph to be fully -colourable if admits a full homomorphism to some in . We approach the p…
Strong chordality in tournaments and multipartite tournaments with possible loops
Pavol Hell, César Hernández-Cruz, Jing Huang
Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a line…
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
Strong cocomparability graphs and Slash-free orderings of matrices
Pavol Hell, Jing Huang, Jephian C. -H. Lin
We introduce the class of strong cocomparability graphs, as the class of reflexive graphs whose adjacency matrix can be rearranged by a simultaneous row and column permutation to a…
Min orderings and list homomorphism dichotomies for signed and unsigned graphs
Jan Bok, Richard Brewster, Pavol Hell +2
The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism probl…
Describing hereditary properties by forbidden circular orderings
Santiago Guzmán-Pro, Pavol Hell, César Hernández-Cruz
Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes p…