✦ LIBER ✦

Interval graphs and related topics

✍ Scribed by Martin Charles Golumbic

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 643 KB
Volume: 55
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90039-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper-embeddable graphs and related topi

Upper-embeddable graphs and related topics

✍ Nguyen Huy Xuong 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 366 KB

On partitioning interval graphs into pro

On partitioning interval graphs into proper interval subgraphs and related problems

✍ Frédéric Gardi 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

In this paper, we establish that any interval graph (resp. circulararc graph) with n vertices admits a partition into at most log 3 n (resp. log 3 n +1) proper interval subgraphs, for n>1. The proof is constructive and provides an efficient algorithm to compute such a partition. On the other hand, t

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 .

Interval graphs and seatching

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