Recognizing dart-free graphs
The weakly decomposition of a graph that is the partition of the set of vertices in three classes A, B, C such that A induces a connected graph, and C is totally adjacent to B and totally nonadjacent to A. This paper presents a recognition algorithm of dart-free graphs, using the weakly decomposition.
weakly decomposition recognition algorithm dart graph