✦ LIBER ✦

Characterizations of fuzzy interval graphs

✍ Scribed by W.L. Craine

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 801 KB
Volume: 68
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(94)90044-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A matrix characterization of interval an

A matrix characterization of interval and proper interval graphs

✍ George B. Mertzios 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 266 KB

In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is ass

A new characterization of proper interva

A new characterization of proper interval graphs

✍ Zygmunt Jackowski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 379 KB

One of the first characterizations of interval graphs, given by Lekkerkerker and Boland (1962), uses the concept of an asteroidal triple. In this paper we give a similar characterization on the proper interval graphs using the akin concept of an astral triple.

A characterization of uniquely represent

A characterization of uniquely representable interval graphs

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

Characterizations of signed graphs

✍ Thomas Zaslavsky 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract The possible classes of balanced circles of a signed graph are characterized in two ways.

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem