Bibliography

1

A. Berry, P. Heggernes, and Y. Villanger.
A vertex incremental approach for dynamically maintaining chordal graphs.
In Algorithms and Computation - ISAAC 2003, pages 47-57. Springer Verlag, 2003.
LNCS 2906.

2

M. C. Golumbic.
Algorithmic Graph Theory and Perfect Graphs.
Academic Press, 1980.

3

P. W. Goldberg, M. C. Golumbic, H. Kaplan, and R. Shamir.
Four strikes against physical mapping of DNA.
J. Comput. Bio., 2(1):139-152, 1995.

4

J. Gustedt.
On the pathwidth of chordal graphs.
Discrete Applied Mathematics, 45(3):233-248, 2003.

5

P. Heggernes, K. Suchan, I. Todinca, and Y. Villanger.
Minimal interval completions.
Lecture Notes in Computer Science, Volume 3669, Oct 2005, Pages 403 - 414

6

C.G. Lekkerkerker and J.C. Boland.
Representation of a finite graph by a set of inte