On Characterizations for Subclasses of Directed Co-Graphs

07/01/2019
by   Frank Gurski, et al.
0

Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the P_4-free graphs (where P_4 denotes the path on 4 vertices). Co-graphs itself and several subclasses haven been intensively studied. Among these are trivially perfect graphs, threshold graphs, weakly quasi threshold graphs, and simple co-graphs. Directed co-graphs are precisely those digraphs which can be defined from the single vertex graph by applying the disjoint union, order composition, and series composition. By omitting the series composition we obtain the subclass of oriented co-graphs which has been analyzed by Lawler in the 1970s and the restriction to linear expressions was recently studied by Boeckner. There are only a few versions of subclasses of directed co-graphs until now. By transmitting the restrictions of undirected subclasses to the directed classes, we define the corresponding subclasses for directed co-graphs. We consider directed and oriented versions of threshold graphs, simple co-graphs, co-simple co-graphs, trivially perfect graphs, co-trivially perfect graphs, weakly quasi threshold graphs and co-weakly quasi threshold graphs. For all these classes we provide characterizations by finite sets of minimal forbidden induced subdigraphs. Further we analyze relations between these graph classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2018

Computing directed path-width and directed tree-width of recursively defined digraphs

In this paper we consider the directed path-width and directed tree-widt...
research
10/03/2021

On monoid graphs

We investigate Cayley graphs of finite semigroups and monoids. First, we...
research
12/05/2017

Percolation Threshold Results on - Graphs: an Empirical Process Approach

In this paper we define a directed percolation over Erdos-Renyi graphs a...
research
05/02/2023

Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs

In the zero-error Slepian-Wolf source coding problem, the optimal rate i...
research
12/26/2020

Efficient computation of the oriented chromatic number of recursively defined digraphs

Given some oriented graph G=(V,E), an oriented r-coloring for G is a par...
research
02/27/2018

Constructing graphs with limited resources

We discuss the amount of physical resources required to construct a give...
research
02/01/2023

Adding a Tail in Classes of Perfect Graphs

Consider a graph G which belongs to a graph class C. We are interested i...

Please sign up or login with your details

Forgot password? Click here to reset