Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2

DOI10.1016/j.disc.2016.08.015zbMath1351.05051OpenAlexW2519549377MaRDI QIDQ2374177

Marina Lipshteyn, Martin Charles Golumbic, Michal Stern, Elad Cohen

Publication date: 14 December 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.08.015

zbMATH Keywords

complete bipartite graphchordal graphweakly chordal graphintersection graph of subtrees of a tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Intersection models of weakly chordal graphs
• 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
• Optimizing weakly triangulated graphs
• A characterisation of rigid circuit graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3
• The \(k\)-edge intersection graphs of paths in a tree
• Representing edge intersection graphs of paths on degree 4 trees
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Finding Intersection Models of Weakly Chordal Graphs
• What Is between Chordal and Weakly Chordal Graphs?

This page was built for publication: Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2