The vertex sets of subtrees of a tree

DOI10.37236/14646MaRDI QIDQ7234742zbMATH OpenFDO

Authors Maria Chudnovsky, Tung Nguyen, Alex Scott, Paul Seymour

Publication date 29 April 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/14646

zbMATH Keywords

chordal intersection graphHelly property

Mathematics Subject Classification ID

Trees (05C05) Infinite graphs (05C63) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A characterisation of rigid circuit graphs
• A structure theorem for the consecutive 1's property
• Clique-sums, tree-decompositions and compactness
• Excluding a countable clique
• Graph theory (to appear)
• scientific article; zbMATH DE number 4164908 (Why is no real title available?)
• scientific article; zbMATH DE number 3332242 (Why is no real title available?)
• Matroids and Graphs
• On the representation of triangulation graphs in trees
• Representation of a finite graph by a set of intervals on the real line
• Representations of chordal graphs as subtrees of a tree
• Some remarks on interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The Menger-like property of the three-width of infinite graphs
• Tree-decompositions, tree-representability and chordal graphs

This page was built for publication: The vertex sets of subtrees of a tree

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