
Minimal obstructions to (s,1)polarity in cographs
Let k,l be nonnegative integers. A graph G is (k,l)polar if its vertex ...
read it

Minimal obstructions to (∞, k)polarity in cographs
A graph is a cograph if it does not contain a 4vertex path as an induce...
read it

Minimal obstructions for a matrix partition problem in chordal graphs
If M is an m × m matrix over { 0, 1, ∗}, an Mpartition of a graph G is ...
read it

Orientations without forbidden patterns on three vertices
Given a set of oriented graphs F, a graph G is an Fgraph if it admits a...
read it

Duality pairs and homomorphisms to oriented and unoriented cycles
In the homomorphism order of digraphs, a duality pair is an ordered pair...
read it

Duality pairs and homomorphisms to oriented and unoriented cycles
In the homomorphism order of digraphs, a duality pair is an ordered pair...
read it

Strongly chordal digraphs and Γfree matrices
We define strongly chordal digraphs, which generalize strongly chordal g...
read it

Vertex arboricity of cographs
Arboricity is a graph parameter akin to chromatic number, in that it see...
read it
César Hernández Cruz
is this you? claim profile