1 citations · 1 across the 3 of their papers we have counts for
6 papers
Minimal obstructions to -polarity in cographs
F. Esteban Contreras-Mendoza, César Hernández-Cruz
A graph is a cograph if it does not contain a 4-vertex path as an induced subgraph. An -polar partition of a graph is a partition of its vertex set such that $…
Oriented expressions of graph properties
Santiago Guzmán-Pro, César Hernández-Cruz
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if is the set of homomor…
Minimal obstructions for a matrix partition problem in chordal graphs
Juan Carlos García-Altamirano, César Hernández-Cruz
If is an matrix over , an -partition of a graph is a partition such that is completely adjacent (non-adjacent) to…
Duality pairs and homomorphisms to oriented and unoriented cycles
Santiago Guzmán-Pro, César Hernández-Cruz
In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs such that for any digraph, , if and only if . The directed path…
Panchromatic patterns by paths
Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz
Let be a digraph, possibly with loops, and let be a loopless multidigraph with a colouring of its arcs . An -path of is…
Minimal digraph obstructions for small matrices
Pavol Hell, César Hernández-Cruz
Given a -matrix , a minimal -obstruction is a digraph such that is not -partitionable, but every proper induced subdigraph of is. In this not…