A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, ...
[PDF] On some subclasses of interval catch digraphs - Semantic Scholar
pdfs.semanticscholar.org › ...
In our paper, we study some natural subclasses of ICD, namely central interval catch digraph. (in brief, central ICD), oriented interval catch digraph (in brief ...
Oct 16, 2020 · Recently, we characterized three important subclasses of interval catch digraphs. In this article we introduce a new class of catch digraphs ...
Abstract: A digraph G = (V;E) is an interval catch digraph if for each vertex v ∊ V, one can associate an interval on real line and a point within it (say ...
Nov 30, 2017 · Interval catch digraphs (ICD) was introduced by Maehera in 1984. In his introducing paper Maehera proposed a conjecture for the characterization ...
It is shown that a (finite or infinite) digraph D is the catch digraph of a family of pointed intervals if and only if it contains no set of three vertices ...
Missing: subclasses | Show results with:subclasses
Interval catch digraphs allow nest representations where each set Tv contains just one element. In this paper we show that the following problems can be solved ...
Missing: subclasses | Show results with:subclasses
A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, pv)) in ...
Many different subclasses of interval digraphs have been defined and studied in the literature by restricting the kinds of pairs of intervals that can be ...
We observe that several of these classes, like interval catch digraphs, interval nest digraphs, adjusted interval digraphs and chronological interval digraphs ...