A characterization of interval catch digraphs
From MaRDI portal
Publication:1118608
DOI10.1016/0012-365X(89)90271-9zbMath0669.05038MaRDI QIDQ1118608
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (12)
Algorithms for interval catch digraphs ⋮ Unnamed Item ⋮ Max point-tolerance graphs ⋮ On some subclasses of interval catch digraphs ⋮ Cliques that are tolerance digraphs ⋮ Recognition and characterization of chronological interval digraphs ⋮ On the kernel and related problems in interval digraphs ⋮ Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms ⋮ Intersection representation of digraphs in trees with few leaves ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Adjusted Interval Digraphs
Cites Work
This page was built for publication: A characterization of interval catch digraphs