Directed Graphclass: directed line

Definition:

A directed graph $G$ is a directed line graph if it is the adjoint of a directed graph without multi-edges.

References

[1634]
N. Apollonio, P.G. Franciosa
A characterization of partial directed line graphs
Discrete Math. 307 2598 2614 (2007)

Equivalent classes

[+]Details

Inclusions

The map shows the inclusions between the current class and a fixed set of landmark classes. Minimal/maximal is with respect to the contents of ISGCI. Only references for direct inclusions are given. Where no reference is given, check equivalent classes or use the Java application. To check relations other than inclusion (e.g. disjointness) use the Java application, as well.

Map

[+]Details

Minimal superclasses

[+]Details

Parameters

Problems

Problems in italics have no summary page and are only listed when ISGCI contains a result for the current class.

Parameter decomposition

Unweighted problems

Graph isomorphism
[?]
Input: Graphs G and H in this class
Output: True iff G and H are isomorphic.
Unknown to ISGCI [+]Details
Hamiltonian cycle
[?]
Input: A graph G in this class.
Output: True iff G has a simple cycle that goes through every vertex of the graph.
Polynomial [+]Details
Hamiltonian path
[?]
Input: A graph G in this class.
Output: True iff G has a simple path that goes through every vertex of the graph.
Unknown to ISGCI [+]Details
Recognition
[?]
Input: A graph G.
Output: True iff G is in this graph class.
Polynomial [+]Details

Weighted problems