A superclass of edge-path-tree graphs with few cliques
type: Item
instance of: scholarly article
title: A superclass of edge-path-tree graphs with few cliques
zbMATH Open document ID: 1200.05151
author: Nicola Apollonio
author: Massimiliano Caramia
published in: Operations Research Letters
publication date: 2009-11-17T00:00:00Z
full work available at URL: http://hdl.handle.net/2108/817
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5634573
zbMATH Keywords: EPT graphs
zbMATH Keywords: edge path tree graphs
zbMATH Keywords: intersection graphs
zbMATH Keywords: graphic matroids
MaRDI profile type: Publication
OpenAlex ID: W2073233743
cites work: The edge intersection graphs of paths in a tree
cites work: Intersection graphs of paths in a tree
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: Algorithm Theory - SWAT 2004
cites work: On the strong \(p\)-Helly property
cites work: Q3218167
cites work: Q4288086
cites work: Combinatorial optimization. Packing and covering
cites work: Q3818127
cites work: Hypergraphes de chaînes d'aretes d'un arbre
DOI: 10.1016/J.ORL.2009.05.002
description: scientific article; zbMATH DE number 5634573