Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- Subgraph trees in graph theory (Q1406544) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
- Chordally signed graphs (Q1613353) (← links)
- Quasi-median graphs from sets of partitions (Q1613411) (← links)
- Hyperplanes of Squier's cube complexes (Q1631694) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- Strict chordal digraphs viewed as graphs with distinguished edges (Q1671322) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- On the number of maximal independent sets in minimum colorings of split graphs (Q1671359) (← links)
- Kneser ranks of random graphs and minimum difference representations (Q1689964) (← links)
- Requiring that minimal separators induce complete multipartite subgraphs (Q1692647) (← links)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Reconstructing pedigrees: a stochastic perspective (Q1788666) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Paired threshold graphs (Q1801073) (← links)
- Competition polysemy (Q1827753) (← links)
- The solution of two problems on bound polysemy (Q1827754) (← links)
- Hyperbolic bridged graphs (Q1864582) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- A SLLN for a one-dimensional class cover problem (Q1871304) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices (Q1886361) (← links)
- 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)