César Hernández-Cruz

activity

20122025

most citedOn the existence and number of

(k + 1)

-kings in

k

-quasi-transitive digraphs

14 citations · 19 across the 14 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Minimal obstructions to $2$ -polar cographs

Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales

A graph is a cograph if it is $P_{4}$ -free. A $k$ -polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by…

math.CO2017

The strong convexity spectra of grids

Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros

Let $D$ be a connected oriented graph. A set $S \subseteq V (D)$ is convex in $D$ if, for every pair of vertices $x, y \in S$ , the vertex set of every $x y$ -geodesic, ( $x y$ shortest…

math.CO2017

Mixed Cages

G. Araujo-Pardo, C. Hernández-Cruz, J. J. Montellano-Ballesteros

We introduce the notion of a $[z, r; g]$ -mixed cage. A $[z, r; g]$ -mixed cage is a mixed graph $G$ , $z$ -regular by arcs, $r$ -regular by edges, with girth $g$ and minimum order. In…

Minimal obstructions to 2-polar cographs

The strong convexity spectra of grids

Mixed Cages

Minimal obstructions to $2$ -polar cographs