Recognizing Helly edge-path-tree graphs and their clique graphs

DOI10.1016/j.dam.2011.02.008zbMath1223.05293OpenAlexW2035795844MaRDI QIDQ2275917

Nicola Apollonio, Massimiliano Caramia

Publication date: 10 August 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.02.008

zbMATH Keywords

Helly propertyclique graphsedge-path-tree graphsedge-path-tree matrices

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Edge contraction and edge removal on iterated clique graphs ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Strong cliques and equistability of EPT graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• A superclass of edge-path-tree graphs with few cliques
• Integrality properties of edge path tree families
• Characterizations of strongly chordal graphs
• Edge and vertex intersection of paths in a tree
• Triangulated edge intersection graphs of paths in a tree
• Intersection graphs of paths in a tree
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Hypergraphes de chaînes d'aretes d'un arbre
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• A recognition algorithm for the intersection graphs of paths in trees
• Recognizing clique graphs of directed and rooted path graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Recognizing clique graphs of directed edge path graphs
• The arborescence-realization problem
• Intersection representations of graphs by arcs
• Combinatorial Optimization
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• A New Algorithm for Generating All the Maximal Independent Sets
• Graph Classes: A Survey
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• Algorithm Theory - SWAT 2004
• Combinatorial Configurations

This page was built for publication: Recognizing Helly edge-path-tree graphs and their clique graphs