Abstract
The intersection graph of a family of subtrees of a tree is always a triangulated graph, and vice versa every finite triangulated graph can be represented in this way. The analogous statement is in general not true for infinite triangulated graphs. A characterization of the graphs which are “tree-representable” in this sense is given by means of simplicial decompositions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
