Probe interval graphs have been introduced in the physical mapping and sequencing of DNA as a generalization of interval graphs. We prove that probe interval graphs are weakly triangulated, and hence are perfect, and characterize probe interval graphs by consecutive orders of their intrinsic cliques
Tagged Probe Interval Graphs
โ Scribed by Li Sheng; Chi Wang; Peisen Zhang
- Book ID
- 110281973
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 60 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--\*F such that uv ~E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by clo