✦ LIBER ✦

Proper interval graphs and the guard problem

✍ Scribed by Chiuyuan Chen; Chin-Chen Chang; Gerard J. Chang

Book ID: 108316104
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 437 KB
Volume: 170
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00307-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A relationship between triangulated grap

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

Certifying LexBFS Recognition Algorithms

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

✍ Hell, Pavol; Huang, Jing 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 211 KB 👁 1 views

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

Lexicographic orientation and representa

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

✍ Pavon Hell; Jing Huang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent

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