Recommendations
Cited in
(only showing first 100 items - show all)- The complexity of clique graph recognition
- Localized and compact data-structure for comparability graphs
- New work for Carnap's quasi-analysis
- Cube intersection concepts in median graphs
- The clique-separator graph for chordal graphs
- Scale free interval graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- A dynamic distributed approach to representing proper interval graphs
- APX-hardness of domination problems in circle graphs
- A new characterization of strongly chordal graphs
- Subgraph trees in graph theory
- An approach to solving \(A^{k}=J-I\)
- The composition of semi-finished inventories at a solid board plant.
- On the distribution of the domination number for random class cover catch digraphs
- Chordally signed graphs
- Quasi-median graphs from sets of partitions
- Hyperplanes of Squier's cube complexes
- 3-coloring arrangements of line segments with 4 slopes is hard
- Strict chordal digraphs viewed as graphs with distinguished edges
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- On the number of maximal independent sets in minimum colorings of split graphs
- Kneser ranks of random graphs and minimum difference representations
- Requiring that minimal separators induce complete multipartite subgraphs
- Biclique cover and local clique cover of graphs
- Tractabilities and intractabilities on geometric intersection graphs
- Convex and isometric domination of (weak) dominating pair graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Towards a comprehensive theory of conflict-tolerance graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Dyadic representations of graphs
- Reconstructing pedigrees: a stochastic perspective
- Interval \(k\)-graphs and orders
- A vertex ordering characterization of simple-triangle graphs
- Paired threshold graphs
- Competition polysemy
- The solution of two problems on bound polysemy
- Hyperbolic bridged graphs
- Intersection graphs of maximal hypercubes
- A SLLN for a one-dimensional class cover problem
- On the computational complexity of 2-interval pattern matching problems
- Algorithmic graph theory and perfect graphs
- Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
- Chordal probe graphs
- Threshold graphs and related topics
- The longest path problem is polynomial on cocomparability graphs
- Interval graph limits
- A fully dynamic graph algorithm for recognizing interval graphs
- Fixed cardinality stable sets
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Succinct navigational oracles for families of intersection graphs on a circle
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- On the iterated edge-biclique operator
- Forced pairs in \(A\)-Stick graphs
- Embedding ray intersection graphs and global curve simplification
- Hypergraph representation via axis-aligned point-subspace cover
- Double-threshold permutation graphs
- Constant threshold intersection graphs of orthodox paths in trees
- The niche graphs of bipartite tournaments
- A recognition algorithm for simple-triangle graphs
- Parikh word representability of bipartite permutation graphs
- On graphs of bounded semilattices
- Characterising circular-arc contact \(B_0\)-VPG graphs
- Characterization of 2-path signed network
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- Toll convexity
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- On clique coverings of complete multipartite graphs
- Bayesian networks: the minimal triangulations of a graph
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Extending partial representations of subclasses of chordal graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Characterizing atoms that result from decomposition by clique separators
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Factoring Boolean functions using graph partitioning
- New graph classes characterized by weak vertex separators and two-pairs
- Intersection graphs of orthodox paths in trees
- Set labelling vertices to ensure adjacency coincides with disjointness
- Proper circular arc graphs as intersection graphs of paths on a grid
- On the hyperbolicity constant of circular-arc graphs
- Some new results on Jacobson graphs
- The minimum-area spanning tree problem
- Characterization of classical graph classes by weighted clique graphs
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- The complete optimal stars-clustering-tree problem
- Geodeticity of the contour of chordal graphs
- A new family of proximity graphs: class cover catch digraphs
- Maxclique and unit disk characterizations of strongly chordal graphs
- Requiring chords in cycles
- The numbers of shared upper bounds determine a poset
- On the isomorphism problem for Helly circular-arc graphs
- Computing the clique-separator graph for an interval graph in linear time
- Dot product dimensions of graphs
- Chordal multipartite graphs and chordal colorings
- Complete characterization of incorrect orthology assignments in best match graphs
- Vertices removal for feasibility of clustered spanning trees
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Temporal matching on geometric graph data
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs
- Strengthening strongly chordal graphs
- When all minimal vertex separators induce complete or edgeless subgraphs
This page was built for publication: Topics in Intersection Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4231782)
