Representations of chordal graphs as subtrees of a tree
From MaRDI portal
Cited in
(60)- The clique-separator graph for chordal graphs
- Brambles and independent packings in chordal graphs
- Neighborhood perfect graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Intersection properties of graphs
- Connectivity threshold for random chordal graphs
- Representing triangulated graphs in stars
- Induced matchings
- The forbidden subgraph characterization of directed vertex graphs
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Subgraph trees in graph theory
- Induced matchings in asteroidal triple-free graphs
- Complexity of distance paired-domination problem in graphs
- On minimal vertex separators of dually chordal graphs: properties and characterizations
- Towards a comprehensive theory of conflict-tolerance graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Dyadic representations of graphs
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Intersection graphs of vertex disjoint paths in a tree
- Subpath acyclic digraphs
- Chordal digraphs
- Rank inequalities for chordal graphs
- Unit hypercube visibility numbers of trees
- The vertex leafage of chordal graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- On asteroidal sets in chordal graphs
- Characterization of classical graph classes by weighted clique graphs
- Tree decomposition and discrete optimization problems: a survey
- Maximal sub-triangulation in pre-processing phylogenetic data
- End simplicial vertices in path graphs
- Minimal vertex separators and new characterizations for dually chordal graphs
- Minimum average distance clique trees
- Asteroidal Chromatic Number of a Graph
- Loop Graphs and Asteroidal Sets
- Clique trees of chordal graphs: leafage and 3-asteroidals
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Two characterisations of the minimal triangulations of permutation graphs
- On the algorithmic complexity of \(k\)-tuple total domination
- Finding intersection models: from chordal to Helly circular-arc graphs
- On the structure of (pan, even hole)-free graphs
- Succinct data structures for chordal graphs
- Defining a phylogenetic tree with the minimum number of r-state characters
- Separator orders in interval, cocomparability, and AT-free graphs
- Intersection graphs of non-crossing paths
- Recognizing Proper Tree-Graphs
- Treewidth versus clique number. II: Tree-independence number
- Characterization and representation problems for intersection betweennesses
- Graphs with at most two moplexes
- Graphs of bounded chordality
- Constrained outer-string representations
- The vertex sets of subtrees of a tree
- Constrained outer-string representations
- Linear colorings of graphs
- Extending cycles in graphs
- On the representation of triangulation graphs in trees
- Approximation algorithms for treewidth
- Tree representations of graphs
- Treewidth computations. I: Upper bounds
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
This page was built for publication: Representations of chordal graphs as subtrees of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3882481)
