Recommendations
- scientific article; zbMATH DE number 1554936
- On the structure of trapezoid graphs
- Triangulating Vertex-Colored Graphs
- scientific article; zbMATH DE number 437536
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and generalizations, geometry and algorithms
- Dominations in trapezoid graphs
- Chromaticity of triangulated graphs
- The coloring of graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906537 (Why is no real title available?)
- scientific article; zbMATH DE number 3970528 (Why is no real title available?)
- scientific article; zbMATH DE number 4039253 (Why is no real title available?)
- scientific article; zbMATH DE number 4063148 (Why is no real title available?)
- Betweenness, orders and interval graphs
- Comparability graphs and intersection graphs
- Optimal Placement for River Routing
- Permutation Graphs and Transitive Graphs
- The Complexity of the Partial Order Dimension Problem
- The NP-completeness column: an ongoing guide
- Tolerance graphs
Cited in
(57)- Unit and proper tube orders
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Efficient algorithm for the vertex connectivity of trapezoid graphs
- How to use the minimal separators of a graph for its chordal triangulation
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs
- Approximation of RNA multiple structural alignment
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Counting the number of vertex covers in a trapezoid graph
- Tangent circle graphs and `orders'
- Efficient algorithms for the minimum connected domination on trapezoid graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- On strict (outer-)confluent graphs
- A recognition algorithm for simple-triangle graphs
- All trapezoids are Ramsey
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- A parallel algorithm for solving the coloring problem on trapezoid graphs
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
- On the structure of trapezoid graphs
- A characterization of interval orders with semiorder dimension two
- scientific article; zbMATH DE number 1554936 (Why is no real title available?)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- The recognition of triangle graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- On linear and circular structure of (claw, net)-free graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- The hub number of co-comparability graphs
- Dominations in trapezoid graphs
- Parallel algorithms for the domination problems in trapezoid graphs
- Asteroidal triple-free graphs
- Approximating the 2-interval pattern problem
- Extracting constrained 2-interval subsets in 2-interval sets
- Measuring the vulnerability for classes of intersection graphs
- Proper and unit bitolerance orders and graphs
- Triangulating multitolerance graphs
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS
- Optimal grid representations
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- A recognition algorithm for orders of interval dimension two
- Connected domination and dominating clique in trapezoid graphs
- On the computational complexity of 2-interval pattern matching problems
- Donation center location problem
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- Interval dimension is a comparability invariant
- On powers of m-trapezoid graphs
- New results on induced matchings
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Counting maximal independent sets in directed path graphs
- Max-min weight balanced connected partition
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- A linear time algorithm to compute a dominating path in an AT-free graph
- A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Efficient maximum matching algorithms for trapezoid graphs
This page was built for publication: Trapezoid graphs and their coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111577)
