3D-interval-filament graphs

Gavril [F. Gavril, Maximum weight independent sets and cliques in intersection graphs of filaments, Inform. Process. Lett. 73 (2000) 181-188] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of interval-filament graphs are the cointerval mixed graphs and the complements of subtree-filament graphs are the cochordal mixed graphs. The family of interval-filament graphs contains the families of cocomparability, polygon-circle, circle and chordal graphs. In the present paper we introduce a generalization of the subtree-filament graphs, namely, the 3D-interval-filament graphs. We prove that the family of 3D-interval-filament graphs, the family of complements of co(interval-filament) mixed graphs and the family of overlap graphs of interval-filaments are the same, and show that every 3D-interval-filament graph has an intersection representation by a family of piecewise linear filaments. We use the properties of these graphs to describe an algorithm for maximum weight holes of a given parity in 3D-interval-filament graphs and an algorithm for antiholes of a given parity in interval-filament and subtree-filament graphs. We define various subfamilies of 3D-interval-filament graphs and characterize them as overlap graphs and as complements of H-mixed graphs.

[1]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[2]  Svante Janson,et al.  Thresholds for classes of intersection graphs , 1992, Discret. Math..

[3]  Fanica Gavril,et al.  Algorithms for maximum weight induced paths , 2002, Inf. Process. Lett..

[4]  GavrilFanica.  Algorithms for maximum weight induced paths , 2002 .

[5]  Kathie Cameron,et al.  Induced Matchings in Intersection Graphs , 2000, Electron. Notes Discret. Math..

[6]  Lorna Stewart,et al.  Maximum independent set and maximum clique algorithms for overlap graphs , 2003, Discret. Appl. Math..

[7]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1997, Discret. Appl. Math..

[8]  F. Roberts.  Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. , 1976 .

[9]  Jorge Urrutia,et al.  Comparability graphs and intersection graphs , 1983, Discret. Math..

[10]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1994, Discret. Appl. Math..

[11]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[12]  Fanica Gavril,et al.  Algorithms on circular-arc graphs , 1974, Networks.

[13]  Anne Berry,et al.  Maximal sub-triangulation in pre-processing phylogenetic data , 2003, Soft Comput..

[14]  Anne Berry,et al.  Maximal Sub-Triangulation as Improving Phylogenetic Data , 2002 .

[15]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[16]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[17]  Fanica Gavril,et al.  Maximum weight independent sets and cliques in intersection graphs of filaments , 2000, Inf. Process. Lett..