Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- On orthogonal ray trees (Q908312) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Graphs with the maximum or minimum number of 1-factors (Q965940) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- On cover-structure graphs (Q967385) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- Exact leaf powers (Q982668) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- New work for Carnap's quasi-analysis (Q1025577) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Scale free interval graphs (Q1035692) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- A new characterization of strongly chordal graphs (Q1301851) (← links)
- 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)