scientific article; zbMATH DE number 4063148
From MaRDI portal
Publication:3797233
zbMATH Open0652.05055MaRDI QIDQ3797233FDOQ3797233
Authors: P. A. Kamula, Derek G. Corneil 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- On certain extensions of intervals in graphs
- Permutation bigraphs and interval containments
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- On permutation graphs
- scientific article; zbMATH DE number 1457239
- Extending partial representations of function graphs and permutation graphs
- Functigraphs: An extension of permutation graphs
- scientific article; zbMATH DE number 4091559
- On combination and permutation graphs
Cited In (42)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Linear-Interval Dimension and PI Orders
- Efficient algorithm for the vertex connectivity of trapezoid graphs
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs
- Title not available (Why is that?)
- Counting the number of vertex covers in a trapezoid graph
- Tangent circle graphs and `orders'
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- A recognition algorithm for simple-triangle graphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
- On the structure of trapezoid graphs
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- The recognition of triangle graphs
- On linear and circular structure of (claw, net)-free graphs
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- The hub number of co-comparability graphs
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- Trapezoid graphs and their coloring
- Asteroidal triple-free graphs
- Dominations in trapezoid graphs
- Parallel algorithms for the domination problems in trapezoid graphs
- Functigraphs: An extension of permutation graphs
- Counting independent sets in a tolerance graph
- Title not available (Why is that?)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Computing shortest 12-representants of labeled graphs
- Max point-tolerance graphs
- A vertex ordering characterization of simple-triangle graphs
- Pseudo‐Interval Graphs
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- Connected domination and dominating clique in trapezoid graphs
- Donation center location problem
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
- Vertex splitting and the recognition of trapezoid graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Efficient maximum matching algorithms for trapezoid graphs
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3797233)
