The following pages link to (Q3797233):
Displaying 40 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Counting independent sets in a tolerance graph (Q479039) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Dominations in trapezoid graphs (Q1342259) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Donation center location problem (Q1949758) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- The hub number of co-comparability graphs (Q2514123) (← links)
- Functigraphs: An extension of permutation graphs (Q3011610) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- Linear-Interval Dimension and PI Orders (Q3503538) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- (Q4584151) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Pseudo‐Interval Graphs (Q4857430) (← links)
- Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← 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)
