The intersection graphs of subtrees in trees are exactly the chordal graphs

Cites work

scientific article; zbMATH DE number 3307330 (Why is no real title available?)
A Characterization of Comparability Graphs and of Interval Graphs
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
Construction of ternary H_v-groups and ternary P-hyperoperations.
Incidence matrices and interval graphs
Incidence matrices, interval graphs and seriation in archeology
Intersection representations of graphs by arcs
Matrix characterizations of circular-arc graphs
On rigid circuit graphs
Representation of a finite graph by a set of intervals on the real line
Triangulated graphs and the elimination process

Cited in

(only showing first 100 items - show all)

Two strikes against perfect phylogeny
Tight bounds for chordal/interval vertex deletion parameterized by treewidth
The cluster deletion problem for cographs
Dominating cliques in chordal graphs
Beyond recognizing well-covered graphs
The pagenumber of k-trees is O(k)
Parameterized complexity of conflict-free matchings and paths
Constant threshold intersection graphs of orthodox paths in trees
On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Representation characterizations of chordal bipartite graphs
Minimal elimination ordering for graphs of bounded degree
Bounds on the bend number of split and cocomparability graphs
On the algorithmic complexity of \(k\)-tuple total domination
A characterization of substar graphs
A Characterisation of the Minimal Triangulations of Permutation Graphs
Representing orders by moving figures in space
On the iterated biclique operator
Separator orders in interval, cocomparability, and AT-free graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Contraction bidimensionality of geometric intersection graphs
Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
The neighborhood polynomial of chordal graphs
A note on independence complexes of chordal graphs and dismantling
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
Optimization problems in multiple subtree graphs
scientific article; zbMATH DE number 7651188 (Why is no real title available?)
String graphs. I: The number of critical nonstring graphs is infinite
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
Connected vertex cover for \((sP_1+P_5)\)-free graphs
scientific article; zbMATH DE number 7559375 (Why is no real title available?)
Detecting fixed patterns in chordal graphs in polynomial time
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
Graphs with a unique maximum independent set up to automorphisms
Algorithms and bounds for very strong rainbow coloring
Fugitive-search games on graphs and related parameters
Structural submodularity and tangles in abstract separation systems
Finding intersection models: from chordal to Helly circular-arc graphs
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
Tree decomposition and discrete optimization problems: a survey
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
On the iterated edge-biclique operator
Towards a comprehensive theory of conflict-tolerance graphs
Hardness of interval scheduling on unrelated machines
Domination and cut problems on chordal graphs with bounded leafage
Obstructions to faster diameter computation: asteroidal sets
Linear-time algorithms for tree root problems
On the parameterized complexity of interval scheduling with eligible machine sets
Graphs without large apples and the maximum weight independent set problem
Characterization of 2-path signed network
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
End simplicial vertices in path graphs
Chordal graphs and their clique graphs
The Neighborhood Polynomial of Chordal Graphs
Treewidth versus clique number. II: Tree-independence number
Supersolvable saturated matroids and chordal graphs
Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
Algorithms on Subtree Filament Graphs
Tree representations of graphs
Tree-decompositions, tree-representability and chordal graphs
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Characterization of classical graph classes by weighted clique graphs
On asteroidal sets in chordal graphs
Some remarks about leaf roots
Subgraph trees in graph theory
Connected liar's domination in graphs: complexity and algorithms
Representing triangulated graphs in stars
Low-congestion shortcut and graph parameters
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Extending cycles in graphs
Exact square coloring of certain classes of graphs: complexity and algorithms
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
Strong Erdős-Hajnal properties in chordal graphs
Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
Distance queries over dynamic interval graphs
Alternating cycle-free matchings
Unit hypercube visibility numbers of trees
Linear algorithms for chordal graphs of bounded directed vertex leafage
NeST graphs
Relationship among B₁-EPG, VPT and EPT graphs classes
Simpler and unified recognition algorithm for path graphs and directed path graphs
Recognition of chordal graphs and cographs which are cover-incomparability graphs
Packing and covering a tree by subtrees
A vertex incremental approach for maintaining chordality
Further hardness results on rainbow and strong rainbow connectivity
Diameter determination on restricted graph families
A refined analysis of online path coloring in trees
Generating and characterizing the perfect elimination orderings of a chordal graph
Graph minors and parameterized algorithm design
Intersection models of weakly chordal graphs
Searching for better fill-in
Edge contractions in subclasses of chordal graphs
Chordal digraphs
Exact leaf powers
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
Intersection graphs of paths in a tree
On spectrum assignment in elastic optical tree-networks

This page was built for publication: The intersection graphs of subtrees in trees are exactly the chordal graphs

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