Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- Split clique graph complexity (Q393107) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Maximal pivots on graphs with an application to gene assembly (Q608283) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- The dynamic team forming problem: throughput and delay for unbiased policies (Q847121) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- A new analysis of quasianalysis (Q877242) (← 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)
- 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)
- 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)