✦ LIBER ✦

Interval graphs and maps of DNA

✍ Scribed by Michael S. Waterman; Jerrold R. Griggs

Publisher: Springer
Year: 1986
Tongue: English
Weight: 348 KB
Volume: 48
Category: Article
ISSN: 1522-9602
DOI: 10.1016/s0092-8240(86)80006-4

No coin nor oath required. For personal study only.

✦ Synopsis

A special class of interval graphs is defined and characterized, and an algorithm is given for their construction. These graphs are motivated by an important representation of DNA called restriction maps by molecular biologists. Circular restriction maps are easily included.

📜 SIMILAR VOLUMES

Interval mapping graphs and periodic poi

Interval mapping graphs and periodic points of continuous functions

✍ Uhland Burkart 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Interval graphs and interval orders

✍ Peter C. Fishburn 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 949 KB

This paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially

Recognizing edge clique graphs among int

Recognizing edge clique graphs among interval graphs and probe interval graphs

✍ Jing Kong; Yaokun Wu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique grap

Chordal graphs, interval graphs, and wqo

✍ Ding, Guoli 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

Let be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered by . On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by .

Combinatorial Aspects of Interval Orders

Combinatorial Aspects of Interval Orders and Interval Graphs

✍ William T. Trotter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 28 KB

We survey recent research on combinatorial properties of interval orders and interval graphs. Topics include: optimization with an uncooperative partner, ramsey trails, sorting with partial information, tree width and graph decompositions, combinatorial extremal problems, shift graphs, Dedekind's en

Interval graphs and seatching

✍ Lefteris M. Kirousis; Christos H. Papadimitriou 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 247 KB