A directed graph $G$ is a directed line graph if it is the adjoint of a directed graph without multi-edges.
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.
Speed
[?]
The speed of a class $X$ is the function $n \mapsto |X_n|$, where $X_n$ is the set of $n$-vertex labeled graphs in $X$.
Depending on the rate of growths of the speed of the class, ISGCI
distinguishes the following values of the parameter: |
unknown | [+]Details |
Problems in italics have no summary page and are only listed when ISGCI contains a result for the current class.
Graph isomorphism
[?]
|
Unknown to ISGCI | [+]Details | |||||
Hamiltonian cycle
[?]
|
Polynomial | [+]Details | |||||
Hamiltonian path
[?]
|
Unknown to ISGCI | [+]Details | |||||
Recognition
[?]
|
Polynomial | [+]Details |