Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- Chordal probe graphs (Q1887057) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- Interval graph limits (Q1950423) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- On the iterated edge-biclique operator (Q2132393) (← links)
- Forced pairs in \(A\)-Stick graphs (Q2144508) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- The niche graphs of bipartite tournaments (Q2185734) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Parikh word representability of bipartite permutation graphs (Q2185746) (← links)
- On graphs of bounded semilattices (Q2191959) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Characterization of 2-path signed network (Q2221636) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- Toll convexity (Q2255809) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- On clique coverings of complete multipartite graphs (Q2309546) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- Characterizing atoms that result from decomposition by clique separators (Q2364081) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Factoring Boolean functions using graph partitioning (Q2387436) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- Intersection graphs of orthodox paths in trees (Q2413157) (← links)
- Set labelling vertices to ensure adjacency coincides with disjointness (Q2413366) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- On the hyperbolicity constant of circular-arc graphs (Q2420429) (← links)
- Some new results on Jacobson graphs (Q2422578) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- Maxclique and unit disk characterizations of strongly chordal graphs (Q2509548) (← links)
- Requiring chords in cycles (Q2566156) (← links)
- The numbers of shared upper bounds determine a poset (Q2572468) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)