Pages that link to "Item:Q1917255"
From MaRDI portal
The following pages link to Triangulating graphs without asteroidal triples (Q1917255):
Displaying 27 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
- Tree-decompositions of small pathwidth (Q5899355) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
