A superclass of Edge-Path-Tree graphs with few cliques

Authors:
Nicola Apollonio;Massimiliano Caramia
Affiliations:
Istituto per le Applicazioni del Calcolo, M. Picone, Via G. Amendola, 122/D 70126 Bari, Italy;Dipartimento di Ingegneria dell'Impresa, Universití di Roma "Tor Vergata", Via del Politecnico 1, 00133 Roma, Italy
Venue:
Operations Research Letters
Year:
2009

Citing 4
Cited 1

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Theory of linear and integer programming

Theory of linear and integer programming
Combinatorial optimization: packing and covering

Combinatorial optimization: packing and covering
On the strong p-Helly property

Discrete Applied Mathematics

Mengerian quasi-graphical families and clutters

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Edge-Path-Tree (EPT) graphs are intersection graphs of EPT matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. EPT graphs have polynomially many cliques [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinational Theory Series B 38 (1985) 8-22; C.L. Monma, V.K. Wey, Intersection graphs of paths in a tree, Journal of Combinational Theory Series B 41 (1986) 141-181]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. We extend this result to a proper superclass of EPT graphs.