8 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
Tom\' as Feder, Pavol Hell, Carlos Subi
We consider acyclic r-colorings in graphs and digraphs: they color the vertices in r colors, each of which induces an acyclic graph or digraph. (This includes the dichromatic numbe…
Comparability and Cocomparability Bigraphs
Pavol Hell, Jing Huang, Jephian C. -H. Lin +1
We propose bipartite analogues of comparability and cocomparability graphs. Surprizingly, the two classes coincide. We call these bipartite graphs cocomparability bigraphs. We char…