3 citations · 4 across the 6 of their papers we have counts for
8 papers
Minimal obstructions to -polarity in cographs
F. Esteban Contreras-Mendoza, César Hernández-Cruz
Let be nonnegative integers. A graph is -polar if its vertex set admits a partition such that induces a complete multipartite graph with at most pa…
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…
Minimal obstructions to -polar cographs
Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales
A graph is a cograph if it is -free. A -polar partition of a graph is a partition of the set of vertices of into parts and such that the subgraph induced by…
The strong convexity spectra of grids
Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros
Let be a connected oriented graph. A set is convex in if, for every pair of vertices , the vertex set of every -geodesic, ( shortest…