Pages that link to "Item:Q5663894"
From MaRDI portal
The following pages link to Permutation Graphs and Transitive Graphs (Q5663894):
Displaying 50 items.
- Orienting graphs to optimize reachability (Q290248) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- On random trees obtained from permutation graphs (Q738839) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Operations on permutations and representation in graph form (Q1233876) (← links)
- Intersection graphs of curves in the plane (Q1234300) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- Efficient Algorithms for (3,1) Graphs (Q1240742) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Counting maximal independent sets in directed path graphs (Q2015155) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- On the domination number of permutation graphs and an application to strong fixed points (Q2208341) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Competition-reachability of a graph (Q2488931) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- Orientations of circle graphs (Q3956968) (← links)
- The Dimension of a Comparability Graph (Q4128821) (← links)
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (Q4301637) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Circular permutation graphs (Q4745855) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
