Pages that link to "Item:Q2562090"
From MaRDI portal
The following pages link to The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090):
Displaying 50 items.
- End simplicial vertices in path graphs (Q274693) (← links)
- On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- A note on the colorful fractional Helly theorem (Q329541) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- A characterization of substar graphs (Q401150) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Counting independent sets in a tolerance graph (Q479039) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Representing orders by moving figures in space (Q686307) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Extending cycles in graphs (Q750461) (← links)
- On the representation of triangulation graphs in trees (Q794674) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- The neighborhood polynomial of chordal graphs (Q832856) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Tree representations of graphs (Q875046) (← links)
- Asteroidal quadruples in non rooted path graphs (Q891307) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
