Pages that link to "Item:Q1111577"
From MaRDI portal
The following pages link to Trapezoid graphs and their coloring (Q1111577):
Displaying 50 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Max-min weight balanced connected partition (Q386475) (← 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)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- Unit and proper tube orders (Q953272) (← 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)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- All trapezoids are Ramsey (Q1201235) (← links)
- Dominations in trapezoid graphs (Q1342259) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- On powers of \(m\)-trapezoid graphs (Q1902905) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Donation center location problem (Q1949758) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- New results on induced matchings (Q1975379) (← links)
- Counting maximal independent sets in directed path graphs (Q2015155) (← links)
- A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← 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)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- The hub number of co-comparability graphs (Q2514123) (← links)
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308) (← links)
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS (Q3150028) (← links)
- A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph (Q3545835) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Optimal grid representations (Q4651928) (← links)