The following pages link to The recognition of triangle graphs (Q441856):
Displaying 12 items.
- On the hardness of recognizing triangular line graphs (Q442382) (← links)
- Recognizing triangulated Cartesian graph products (Q658038) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- Recognition of triangles by covariogram (Q2439857) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial (Q2849360) (← links)
- The recognition of triangle graphs. (Q3113722) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Extended Learning Graphs for Triangle Finding (Q4636618) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)