research
∙
03/09/2022
Minimal obstructions for polarity, monopolarity, unipolarity and (s,1)-polarity in generalizations of cographs
Every hereditary property can be characterized by finitely many minimal ...
share
research
∙
04/16/2021
Minimal obstructions to (s,1)-polarity in cographs
Let k,l be nonnegative integers. A graph G is (k,l)-polar if its vertex ...
research
∙
04/16/2021
Minimal obstructions to (∞, k)-polarity in cographs
A graph is a cograph if it does not contain a 4-vertex path as an induce...
research
∙
04/02/2020
Minimal obstructions for a matrix partition problem in chordal graphs
If M is an m × m matrix over { 0, 1, ∗}, an M-partition of a graph G is ...
research
∙
03/12/2020
Orientations without forbidden patterns on three vertices
Given a set of oriented graphs F, a graph G is an F-graph if it admits a...
research
∙
03/12/2020
Duality pairs and homomorphisms to oriented and unoriented cycles
In the homomorphism order of digraphs, a duality pair is an ordered pair...
research
∙
03/12/2020
Duality pairs and homomorphisms to oriented and un-oriented cycles
In the homomorphism order of digraphs, a duality pair is an ordered pair...
research
∙
09/09/2019
Strongly chordal digraphs and Γ-free matrices
We define strongly chordal digraphs, which generalize strongly chordal g...
research
∙
07/16/2019
