✦ LIBER ✦

An evolution of interval graphs

✍ Scribed by Edward R. Scheinerman

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 985 KB
Volume: 82
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90206-w

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

Computing the average distance of an int

Computing the average distance of an interval graph

✍ Peter Dankelmann 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 306 KB

An optimal greedy heuristic to color int

An optimal greedy heuristic to color interval graphs

✍ Stephan Olariu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Interval competition graphs of symmetric

Interval competition graphs of symmetric diagraphs

✍ J.Richard Lundgren; Craig W. Rasmussen; John S. Maybee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 700 KB

interval competition graphics of symmetric digrapha. Discrete Mathematics I I9 (1993) I I3 122. The competition graph of a loopless symmetric digraph If is the rwo-.\rc'p grclph. S,(H). Necessary and sufficient conditions on If are given for S,(ff) to be interval or unit interval. These are useful p

Metric characterizations of proper inter

Metric characterizations of proper interval graphs and tree-clique graphs

✍ Gutierrez, M.; Oubi�a, L. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real

Powers of Hamiltonian paths in interval

Powers of Hamiltonian paths in interval graphs

✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi