Pages that link to "Item:Q1392575"
From MaRDI portal
The following pages link to Triangulating multitolerance graphs (Q1392575):
Displaying 12 items.
- The recognition of triangle graphs (Q441856) (← links)
- A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs (Q2820855) (← links)
- (Q3984740) (← links)
- Minimum Fill-in on Circle and Circular-Arc Graphs (Q4209266) (← links)
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs (Q4215725) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Tree-decompositions of small pathwidth (Q5899355) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)