✦ LIBER ✦

A characterization of uniquely representable interval graphs

✍ Scribed by Peter C. Fishburn

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 200 KB
Volume: 12
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90072-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval representations of planar graph

Interval representations of planar graphs

✍ Carsten Thomassen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 867 KB

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.

On the homogeneous representation of int

On the homogeneous representation of interval graphs

✍ Stephan Olariu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

## Abstract An interval graph __G__ is homogeneously representable if for every vertex __v__ of __G__ there exists an interval representation of __G__ with __v__ corresponding to an end interval. We show that the homogeneous representation of interval graphs is rooted in a deeper property of a clas

Characterizations of fuzzy interval grap

Characterizations of fuzzy interval graphs

✍ W.L. Craine 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 801 KB

A characterization of uniquely vertex co

A characterization of uniquely vertex colorable graphs using minimal defining sets

✍ H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani; M. Zaker 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A defining set (sf cute-x coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal d&kg set to be a defining set which does not properly contain another defining set. If G is a uniquely ver