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):
Displayed 50 items.
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Representing orders by moving figures in space (Q686307) (← 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)
- Tree representations of graphs (Q875046) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Characterizing intersection classes of graphs (Q1078582) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Packing and covering a tree by subtrees (Q1101129) (← links)
- Tree-decompositions, tree-representability and chordal graphs (Q1104938) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← 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)
- An inertia formula for Hermitian matrices with sparse inverses (Q1183205) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- An algorithm for testing chordality of graphs (Q1216324) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems (Q1235990) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- Induced matchings (Q1262877) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)