A superclass of edge-path-tree graphs with few cliques

DOI10.1016/j.orl.2009.05.002zbMath1200.05151OpenAlexW2073233743MaRDI QIDQ1038105

Massimiliano Caramia, Nicola Apollonio

Publication date: 17 November 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/817

zbMATH Keywords

intersection graphsgraphic matroidsEPT graphsedge path tree graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ Strong cliques and equistability of EPT graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Intersection graphs of paths in a tree
• Hypergraphes de chaînes d'aretes d'un arbre
• On the strong \(p\)-Helly property
• Combinatorial Optimization
• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithm Theory - SWAT 2004

This page was built for publication: A superclass of edge-path-tree graphs with few cliques