Pages that link to "Item:Q3882481"
From MaRDI portal
The following pages link to Representations of chordal graphs as subtrees of a tree (Q3882481):
Displaying 50 items.
- End simplicial vertices in path graphs (Q274693) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Extending cycles in graphs (Q750461) (← links)
- On the representation of triangulation graphs in trees (Q794674) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Tree representations of graphs (Q875046) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Intersection properties of graphs (Q1175421) (← links)
- Connectivity threshold for random chordal graphs (Q1175564) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Induced matchings (Q1262877) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- On minimal vertex separators of dually chordal graphs: properties and characterizations (Q1759837) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- Chordal digraphs (Q1929220) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Rank inequalities for chordal graphs (Q2366014) (← links)
- Unit hypercube visibility numbers of trees (Q2409537) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Minimal vertex separators and new characterizations for dually chordal graphs (Q2840528) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Asteroidal Chromatic Number of a Graph (Q3439107) (← links)
- Loop Graphs and Asteroidal Sets (Q3439331) (← links)
- Clique trees of chordal graphs: leafage and 3-asteroidals (Q3503559) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
