Representations of chordal graphs as subtrees of a tree
From MaRDI portal
Publication:3882481
DOI10.1002/jgt.3190020311zbMath0441.05022OpenAlexW1972937804MaRDI QIDQ3882481
Publication date: 1978
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190020311
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs ⋮ End simplicial vertices in path graphs ⋮ Neighborhood perfect graphs ⋮ Rank inequalities for chordal graphs ⋮ Generating and characterizing the perfect elimination orderings of a chordal graph ⋮ Approximation algorithms for treewidth ⋮ Intersection graphs of vertex disjoint paths in a tree ⋮ Subpath acyclic digraphs ⋮ Tree representations of graphs ⋮ Unit hypercube visibility numbers of trees ⋮ Two characterisations of the minimal triangulations of permutation graphs ⋮ Chordal digraphs ⋮ Minimum Average Distance Clique Trees ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ Clique trees of chordal graphs: leafage and 3-asteroidals ⋮ Finding intersection models: from chordal to Helly circular-arc graphs ⋮ A Characterisation of the Minimal Triangulations of Permutation Graphs ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ Characterization and representation problems for intersection betweennesses ⋮ Subgraph trees in graph theory ⋮ On the structure of (pan, even hole)‐free graphs ⋮ Induced matchings in asteroidal triple-free graphs ⋮ 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 ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Intersection properties of graphs ⋮ Connectivity threshold for random chordal graphs ⋮ Recognizing Proper Tree-Graphs ⋮ Complexity of distance paired-domination problem in graphs ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ Treewidth computations. I: Upper bounds ⋮ On minimal vertex separators of dually chordal graphs: properties and characterizations ⋮ Towards a comprehensive theory of conflict-tolerance graphs ⋮ Separator orders in interval, cocomparability, and AT-free graphs ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ Intersection graphs of non-crossing paths ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ Unnamed Item ⋮ A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs ⋮ Dyadic representations of graphs ⋮ Representing triangulated graphs in stars ⋮ Induced matchings ⋮ Induced disjoint paths in AT-free graphs ⋮ Extending cycles in graphs ⋮ The clique-separator graph for chordal graphs ⋮ Minimal vertex separators and new characterizations for dually chordal graphs ⋮ Brambles and independent packings in chordal graphs ⋮ The forbidden subgraph characterization of directed vertex graphs ⋮ Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters ⋮ On the representation of triangulation graphs in trees ⋮ Asteroidal Chromatic Number of a Graph ⋮ Loop Graphs and Asteroidal Sets ⋮ Recognition algorithm for intersection graphs of edge disjoint paths in a tree
This page was built for publication: Representations of chordal graphs as subtrees of a tree
