Pages that link to "Item:Q1172652"
From MaRDI portal
The following pages link to Comparability graphs and intersection graphs (Q1172652):
Displaying 50 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Weakly transitive orientations, Hasse diagrams and string graphs (Q686503) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Tolerance graphs (Q798675) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Angle orders, regular n-gon orders and the crossing number (Q1101471) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Counting maximal independent sets in directed path graphs (Q2015155) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
