Helly EPT graphs on bounded degree trees: characterization and recognition

DOI10.1016/J.DISC.2017.08.011MaRDI QIDQ2404370zbMATH OpenOpenAlexFDO

Authors L. Alcón, M. Gutierrez, M. P. Mazzoleni

Publication date 18 September 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://sedici.unlp.edu.ar/handle/10915/102919

zbMATH Keywords

intersection graphsEPT graphstolerance graphs

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• EPT graphs on bounded degree trees
• scientific article; zbMATH DE number 5763164
• Edge and vertex intersection of paths in a tree
• The edge intersection graphs of paths in a tree
• Recognizing Helly edge-path-tree graphs and their clique graphs

Cites work

• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• Constant tolerance intersection graphs of subtrees of a tree
• Decomposition by clique separators
• Decomposition by maxclique separators
• EPT graphs on bounded degree trees
• Edge and vertex intersection of paths in a tree
• Efficient graph representations
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Intersection graphs of paths in a tree
• Representing edge intersection graphs of paths on degree 4 trees
• The edge intersection graphs of paths in a tree
• Twenty Years of EPT Graphs: From Haifa to Rostock

Cited in

(4)

• scientific article; zbMATH DE number 2170450 (Why is no real title available?)
• Recognizing Helly edge-path-tree graphs and their clique graphs
• Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
• EPT graphs on bounded degree trees

This page was built for publication: Helly EPT graphs on bounded degree trees: characterization and recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404370)