Intersection representation of a chordal graph by subtrees of a spanning tree

MaRDI QIDQ3378233zbMATH OpenFDO

Authors Robert E. Jamison, Renu C. Laskar

Publication date 30 March 2006

zbMATH Keywords

canonical representationelimination ordering

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• An efficient representation of chordal graphs
• Chordal Graphs as Intersection Graphs of Pseudosegments
• Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
• Constant tolerance intersection graphs of subtrees of a tree
• Finding intersection models: from chordal to Helly circular-arc graphs

Cited in

(9)

• Tree-decompositions, tree-representability and chordal graphs
• The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
• Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
• An efficient representation of chordal graphs
• Detour trees
• scientific article; zbMATH DE number 434883 (Why is no real title available?)
• On economical set representations of graphs
• Chordal Graphs as Intersection Graphs of Pseudosegments
• On the representation of triangulation graphs in trees

This page was built for publication: Intersection representation of a chordal graph by subtrees of a spanning tree

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