Constant threshold intersection graphs of orthodox paths in trees

DOI10.1016/j.dam.2018.09.029zbMath1440.05152arXiv1703.08465OpenAlexW2963173672MaRDI QIDQ2184664

José Wilson Coura Pinto, Claudson F. Bornstein, Dieter Rautenbach, Jayme Luiz Szwarcfiter

Publication date: 29 May 2020

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

Full work available at URL: https://arxiv.org/abs/1703.08465

zbMATH Keywords

intersection graphline graphchordal graph\((h,s,t)\)-representationorthodox \((h,s,t)\)-representation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
• Recognizing vertex intersection graphs of paths on bounded degree trees
• The edge intersection graphs of paths in a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• Connectivity threshold for random chordal graphs
• A recognition algorithm for the intersection graphs of paths in trees
• Constant tolerance intersection graphs of subtrees of a tree
• Tolerance intersection graphs on binary trees with constant tolerance 3
• Treewidth of graphs with balanced separations
• Graphe représentatif des aretes d'un multigraphe
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Topics in Intersection Graph Theory

This page was built for publication: Constant threshold intersection graphs of orthodox paths in trees