Permutation Graphs and Transitive Graphs
From MaRDI portal
Cited in
(67)- Decomposing a set of points into chains, with applications to permutation and circle graphs
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Bipartite permutation graphs
- On domination problems for permutation and other graphs
- Trapezoid graphs and their coloring
- Algorithmic aspects of intersection graphs and representation hypergraphs
- An algorithm for generating all maximal independent subsets of posets
- Comparability graphs and intersection graphs
- Dominating sets in perfect graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- New clique and independent set algorithms for circle graphs
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- On a graph partition problem with application to VLSI layout
- Some simplified NP-complete graph problems
- Operations on permutations and representation in graph form
- Intersection graphs of curves in the plane
- Comparability graphs and a new matroid
- Efficient Algorithms for (3,1) Graphs
- The complexity of comparability graph recognition and coloring
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- On linear and circular structure of (claw, net)-free graphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Counting maximal independent sets in directed path graphs
- Forbidden induced subgraph characterization of circle graphs within split graphs
- 2-nested matrices: towards understanding the structure of circle graphs
- On the domination number of permutation graphs and an application to strong fixed points
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- 3D-interval-filament graphs
- Competition-reachability of a graph
- Orienting graphs to optimize reachability
- The complexity of the partial order dimension problem: closing the gap
- Fully dynamic algorithms for permutation graph coloring
- A Note on k-Colorability of P 5-Free Graphs
- Two characterisations of the minimal triangulations of permutation graphs
- Orientations of circle graphs
- Permutation bigraphs and interval containments
- The Dimension of a Comparability Graph
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
- Treewidth and pathwidth of permutation graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Circular permutation graphs
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Computing the all-pairs longest chains in the plane
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Efficient local representations of graphs
- Graph classes and forbidden patterns on three vertices
- Permutation graphs and the weak Bruhat order
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- On finding separators in temporal split and permutation graphs
- On finding separators in temporal split and permutation graphs
- Asteroidal triple-free graphs
- Multipermutations and Stirling multipermutations
- Reconfiguring shortest paths in graphs
- A linear time algorithm for finding all hinge vertices of a permutation graph
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
- Simultaneous contact representations of planar graphs
- Characterization of double-arborescences and their minimum length word-representants
- Hamiltonian path in permutation graphs
- Cohen-Macaulay permutation graphs
- Dense and nondense limits for uniform random intersection graphs
- A distance-dependent random graph model and its analysis
- The parallel stack loading problem: polynomial solvability in the unlimited-capacity case and exact approaches for the finite-capacity case
- On random trees obtained from permutation graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Finding a maximum independent set in a permutation graph
- Minimum weight feedback vertex sets in circle graphs
This page was built for publication: Permutation Graphs and Transitive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663894)
