8 citations · 16 across the 11 of their papers we have counts for
10 papers · 1 filter
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…
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…
Minimum Weighted Szeged Index Trees
Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini
Weighted Szeged index is a recently introduced extension of the well-known Szeged index. In this paper, we present a new tool to analyze and characterize minimum weighted Szeged in…
Strongly chordal digraphs and -free matrices
Pavol Hell, Cesar Hernandez-Cruz, Jing Huang +1
We define strongly chordal digraphs, which generalize strongly chordal graphs and chordal bipartite graphs, and are included in the class of chordal digraphs. They correspond to sq…
Vertex arboricity of cographs
Sebastián González Hermosillo de la Maza, Pavol Hell, César Hernández Cruz +2
Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we…