Tree representations of graphs

DOI10.1016/j.ejc.2006.04.002zbMath1119.05074OpenAlexW2151451767MaRDI QIDQ875046

Zoltan Fueredi, Nancy Eaton, Alexandr V. Kostochka, Jozef Skokan

Publication date: 10 April 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.04.002

zbMATH Keywords

intersection graphchordal graphtree representation

Mathematics Subject Classification ID

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

Related Items (2)

Towards a comprehensive theory of conflict-tolerance graphs ⋮ Recognizing vertex intersection graphs of paths on bounded degree trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge and vertex intersection of paths in a tree
• Connectivity threshold for random chordal graphs
• On the maximum number of permutations with given maximal or minimal distance
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• Intersection representation of complete unbalanced bipartite graphs
• A characterisation of rigid circuit graphs
• 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
• Representations of chordal graphs as subtrees of a tree
• Onp-intersection representations
• The Representation of a Graph by Set Intersections

This page was built for publication: Tree representations of graphs