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

Cites Work

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

Cited In (only showing first 100 items - show all)

On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
The cluster deletion problem for cographs
Representation characterizations of chordal bipartite graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
On the algorithmic complexity of \(k\)-tuple total domination
A characterization of substar graphs
Title not available (Why is that?)
Detecting fixed patterns in chordal graphs in polynomial time
End simplicial vertices in path graphs
Some remarks about leaf roots
Connected liar's domination in graphs: complexity and algorithms
Extending cycles in graphs
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
Diameter determination on restricted graph families
Packing and covering a tree by subtrees
A refined analysis of online path coloring in trees
Further hardness results on rainbow and strong rainbow connectivity
Intersection models of weakly chordal graphs
Intersection graphs of paths in a tree
Recognizing interval digraphs and interval bigraphs in polynomial time
The complexity of reconstructing trees from qualitative characters and subtrees
Approximation algorithms for maximum weight k-coverings of graphs by packings
A partial k-arboretum of graphs with bounded treewidth
On models of directed path graphs non rooted directed path graphs
Graph minors. V. Excluding a planar graph
Maximum weight independent sets and cliques in intersection graphs of filaments
On basic chordal graphs and some of its subclasses
On the algorithmic complexity of edge total domination
Minimal triangulations of graphs: a survey
Reduced clique graphs of chordal graphs
Computing role assignments of chordal graphs
Subpath acyclic digraphs
Characterizations of strongly chordal graphs
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Induced matchings
Biclique graphs and biclique matrices
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Asteroidal quadruples in non rooted path graphs
Approximation algorithms for maximum two-dimensional pattern matching
Clique graphs and Helly graphs
Subexponential parameterized algorithms and kernelization on almost chordal graphs
The maximum k-colorable subgraph problem for chordal graphs
On the complexity of computing treelength
Tree spanners on chordal graphs: complexity and algorithms
The clique-separator graph for chordal graphs
10-tough chordal graphs are Hamiltonian (extended abstract)
A note on the colorful fractional Helly theorem
The forbidden subgraph characterization of directed vertex graphs
Thresholds for classes of intersection graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Computing a minimum outer-connected dominating set for the class of chordal graphs
Treewidth computations. I: Upper bounds
A recognition algorithm for the intersection graphs of paths in trees
Recognizing clique graphs of directed and rooted path graphs
On the pathwidth of chordal graphs
Finding minimum height elimination trees for interval graphs in polynomial time
Fugitive-search games on graphs and related parameters
The maximum vertex coverage problem on bipartite graphs
Proper Interval Vertex Deletion
From path graphs to directed path graphs
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Tree decompositions with small cost
Vertex ordering characterizations of graphs of bounded asteroidal number
Characterizing width two for variants of treewidth
10-tough chordal graphs are Hamiltonian
Intersection graphs of Helly families of subtrees
The minimum vulnerability problem on specific graph classes
Representing graphs as the intersection of cographs and threshold graphs
Perfect edge domination and efficient edge domination in graphs
Clique tree generalization and new subclasses of chordal graphs
Hamiltonian circuits in interval graph generalizations
The \(k\)-edge intersection graphs of paths in a tree
The vertex leafage of chordal graphs
On the Algorithmic Complexity of Total Domination
Extending partial representations of circular-arc graphs
A revisit of the scheme for computing treewidth and minimum fill-in
Intersection representations of matrices by subtrees and unicycles on graphs
Expansions of Chromatic Polynomials and Log-Concavity
Counting clique trees and computing perfect elimination schemes in parallel
Characterizing path graphs by forbidden induced subgraphs
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Asteroids in rooted and directed path graphs
Cliques in the union of graphs
Characterizing directed path graphs by forbidden asteroids
Inclusion/exclusion meets measure and conquer
Neighborhood subtree tolerance graphs
Two strikes against perfect phylogeny
Two characterisations of the minimal triangulations of permutation graphs
Algorithms for induced biclique optimization problems
Weighted domination of independent sets
Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
Characterizing intersection classes of graphs
Evaluating Datalog via tree automata and cycluits
On the structure of (pan, even hole)-free graphs
Tree decompositions and social graphs
The parallel solution of domination problems on chordal and strongly chordal graphs
Packing of (0, 1)-matrices
Graph searching on chordal graphs
On the recognition of neighborhood inclusion posets
The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity

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)