✦ LIBER ✦

A characterization of interval catch digraphs

✍ Scribed by Erich Prisner

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 442 KB
Volume: 73
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90271-9

No coin nor oath required. For personal study only.

✦ Synopsis

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 which Wail: any two of them are weakly connected by a chain where no initial endpoint of an arc precedes the third vertex.

Furthermore, it is shown that all these digraphs have weakly triangulated (and thus perfect) underlying graphs.

📜 SIMILAR VOLUMES

New characterizations of digraphs repres

New characterizations of digraphs represented by intervals

✍ Sanyal, Barun K.; Sen, Malay K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

We present new characterizations of interval digraphs, interval graphs, and indifference digraphs, using linear orderings of edges and vertices.

Interval digraphs: An analogue of interv

Interval digraphs: An analogue of interval graphs

✍ S. Das; M. Sen; A. B. Roy; D. B. West 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Intersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uu in the intersection digraph when the "source set" of u intersects the "terminal set" of u. Every n-vertex digraph is an intersection digraph of o

Circular-arc digraphs: A characterizatio

Circular-arc digraphs: A characterization

✍ M. Sen; S. Das; Douglas B. West 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB

The digraphs and inclusion intervals of

The digraphs and inclusion intervals of matrix singular values

✍ Gui-Xian Tian; Ting-Zhu Huang; Shu-Yu Cui 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Characterizations of two classes of digr

Characterizations of two classes of digraphs

✍ Zygmunt Jackowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 796 KB

In the paper we present two characterizations of classes of digraphs. The first is a forbidden triple characterization of digraphs with augmented adjacency matrices having consecutive ones property for columns. The second is a forbidden circuit characterization of digraphs with totally balanced augm

Characterization of self-complementary s

Characterization of self-complementary symmetric digraphs

✍ Hong Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

The class of self-complementary symmetric digraphs is characterized and it is shown that the number of vertices of such a digraph is an odd prime power.