Add to ORKGThis letter gives a new necessary and sufficient condition to determine whether a directed graph is acyclic
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
Abstract. A subset S of vertices in a graph G is acyclic if the subgraph 〈S 〉 induced by S contains ...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
<p>From left to right: a directed acyclic graph, a tree, and an arborescence.</p
The acyclic chromatic number of a directed graph D, denoted χA(D), is the min-imum positive integer ...
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpa...
This paper initiates the study of testing properties of directed graphs. In particular, the paper c...
AbstractThe purpose of this note is to prove a theorem on acyclic digraphs, conjectured by Linial (J...
Peter Spirtes. Calculating TETRAD Constraints Implied by Directed Acyclic Graphs
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
This article puts forth all the existing methods proposed by the various authors of the Stack Exchan...
Abstract. Acyclicity is a recurring property of solutions to many important com-binatorial problems....
Characterization of competition graphs for arbitrary and acyclic directed graphs are presented
AbstractA characterization is given for acyclic digraphs that are the acyclic intersection digraphs ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
Abstract. A subset S of vertices in a graph G is acyclic if the subgraph 〈S 〉 induced by S contains ...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
<p>From left to right: a directed acyclic graph, a tree, and an arborescence.</p
The acyclic chromatic number of a directed graph D, denoted χA(D), is the min-imum positive integer ...
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpa...
This paper initiates the study of testing properties of directed graphs. In particular, the paper c...
AbstractThe purpose of this note is to prove a theorem on acyclic digraphs, conjectured by Linial (J...
Peter Spirtes. Calculating TETRAD Constraints Implied by Directed Acyclic Graphs
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
This article puts forth all the existing methods proposed by the various authors of the Stack Exchan...
Abstract. Acyclicity is a recurring property of solutions to many important com-binatorial problems....
Characterization of competition graphs for arbitrary and acyclic directed graphs are presented
AbstractA characterization is given for acyclic digraphs that are the acyclic intersection digraphs ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
Abstract. A subset S of vertices in a graph G is acyclic if the subgraph 〈S 〉 induced by S contains ...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...