✦ LIBER ✦

A class of acyclic digraphs with interval competition graphs

✍ Scribed by Han Hyuk Cho; Suh-Ryung Kim

Book ID: 108112505
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 195 KB
Volume: 148
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A characterization of competition graphs

A characterization of competition graphs of arbitrary digraphs

✍ Fred S. Roberts; Jeffrey E. Steif 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The competition-common enemy graph of a

The competition-common enemy graph of a digraph

✍ Debra D. Scott 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 535 KB

On the Markov Equivalence of Chain Graph

On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

✍ Steen A. Andersson; David Madigan; Michael D. Perlman 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

A Characterization of Acyclic Switching

A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs

✍ Hage, Jurriaan; Harju, Tero 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 KB

The total interval number of a graph, I:

The total interval number of a graph, I: Fundamental classes

✍ Thomas M. Kratzke; Douglas B. West 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Kratzke, T.M. and D.B. West, The total interval number of a graph, I: Fundamental classes, Discrete Mathematics 118 (1993) 145-156. A multiple-interval representation of a simple graph G assigns each vertex a union of disjoint real intervals, such that vertices are adjacent if and only if their assi