Pages that link to "Item:Q2185743"
From MaRDI portal
The following pages link to A recognition algorithm for simple-triangle graphs (Q2185743):
Displaying 9 items.
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial (Q2849360) (← links)
- The recognition of triangle graphs. (Q3113722) (← links)
- Extended Learning Graphs for Triangle Finding (Q4636618) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)
- Computing shortest 12-representants of labeled graphs (Q6644892) (← links)