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

Cites work

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.
scientific article; zbMATH DE number 3307330 (Why is no real title available?)
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)

Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Edge-maximal graphs of branchwidth k: The k-branches
Intersection models of weakly chordal graphs
The clique-separator graph for chordal graphs
Brambles and independent packings in chordal graphs
Characterizations of strongly chordal graphs
Interval graphs and related topics
Intersection graphs of paths in a tree
Characterizing intersection classes of graphs
Graph minors. V. Excluding a planar graph
Neighborhood perfect graphs
Hamiltonian circuits in interval graph generalizations
Packing and covering a tree by subtrees
Tree-decompositions, tree-representability and chordal graphs
The maximum k-colorable subgraph problem for chordal graphs
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
Simplicial decompositions of graphs: A survey of applications
Algorithmic aspects of intersection graphs and representation hypergraphs
String graphs. I: The number of critical nonstring graphs is infinite
Representations of graphs and networks (coding, layouts and embeddings)
Intersection properties of graphs
Connectivity threshold for random chordal graphs
An inertia formula for Hermitian matrices with sparse inverses
An algorithm for fraternal orientation of graphs
Thresholds for classes of intersection graphs
The complexity of reconstructing trees from qualitative characters and subtrees
An algorithm for testing chordality of graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Information storage and retrieval - mathematical foundations. II: Combinatorial problems
A note on perfect Gaussian elimination
A recognition algorithm for the intersection graphs of paths in trees
Representing triangulated graphs in stars
Counting clique trees and computing perfect elimination schemes in parallel
Induced matchings
All structured programs have small tree width and good register allocation
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
A partial k-arboretum of graphs with bounded treewidth
Recognizing clique graphs of directed and rooted path graphs
The forbidden subgraph characterization of directed vertex graphs
On the pathwidth of chordal graphs
Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
On cocolourings and cochromatic numbers of graphs
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Dominating cliques in chordal graphs
Alternating cycle-free matchings
The parallel solution of domination problems on chordal and strongly chordal graphs
Intersection graphs of concatenable subtrees of graphs
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Finding minimum height elimination trees for interval graphs in polynomial time
Clique tree generalization and new subclasses of chordal graphs
Chromaticity of chordal graphs
Recognizing interval digraphs and interval bigraphs in polynomial time
Fugitive-search games on graphs and related parameters
Matching and multidimensional matching in chordal and strongly chordal graphs
Subgraph trees in graph theory
Maximum independent set and maximum clique algorithms for overlap graphs
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Tree-visibility orders
Completeness for intersection classes
On vertex ranking of a starlike graph
Perfect edge domination and efficient edge domination in graphs
NeST graphs
Computing a clique tree with the algorithm maximal label search
On spectrum assignment in elastic optical tree-networks
Clique trees of infinite locally finite chordal graphs
Complexity of distance paired-domination problem in graphs
Towards a comprehensive theory of conflict-tolerance graphs
Tree decompositions with small cost
Strong branchwidth and local transversals
Constant tolerance intersection graphs of subtrees of a tree
Dyadic representations of graphs
Neighborhood subtree tolerance graphs
Tree spanners on chordal graphs: complexity and algorithms
Generating and characterizing the perfect elimination orderings of a chordal graph
Intersection graphs of vertex disjoint paths in a tree
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Intersection graphs of Helly families of subtrees
Subpath acyclic digraphs
Modular intersection graphs
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
Chordal digraphs
Algorithms for induced biclique optimization problems
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Finding temporal paths under waiting time constraints
Efficiently enumerating minimal triangulations
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
On the complexity of computing treebreadth
Weighted domination of independent sets
Counting maximal independent sets in directed path graphs
Mixing of Markov chains for independent sets on chordal graphs with bounded separators
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
Subexponential parameterized algorithms and kernelization on almost chordal graphs
Representing graphs as the intersection of cographs and threshold graphs
On the maximum cardinality cut problem in proper interval graphs and related graph classes
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
Families of induced trees and their intersection graphs
Tuple domination on graphs with the consecutive-zeros property
On the iterated edge-biclique operator
Graphs with a unique maximum independent set up to automorphisms
Regular vines with strongly chordal pattern of (conditional) independence

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)