Topics in Intersection Graph Theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Split clique graph complexity
- Toll convexity
- Constant threshold intersection graphs of orthodox paths in trees
- Requiring chords in cycles
- Localized and compact data-structure for comparability graphs
- Strengthening strongly chordal graphs
- Decomposing the feasibility of clustered spanning tree by paths
- Gap one bounds for the equitable chromatic number of block graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Recognizing unit multiple intervals is hard
- Dot product dimensions of graphs
- On the iterated biclique operator
- On the isomorphism problem for Helly circular-arc graphs
- Hypercontact semilattices
- Separator orders in interval, cocomparability, and AT-free graphs
- The minimum-area spanning tree problem
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On graphs of bounded semilattices
- Bayesian networks: the minimal triangulations of a graph
- The numbers of shared upper bounds determine a poset
- A SLLN for a one-dimensional class cover problem
- The intersection graph of gamma sets in the total graph of a commutative ring. I
- Finding intersection models: from chordal to Helly circular-arc graphs
- Biclique cover and local clique cover of graphs
- The longest path problem is polynomial on cocomparability graphs
- On the iterated edge-biclique operator
- Towards a comprehensive theory of conflict-tolerance graphs
- On cover-structure graphs
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Characterization of 2-path signed network
- The adjacency matrix of a graph as a data table: a geometric perspective
- Chordally signed graphs
- Proper circular arc graphs as intersection graphs of paths on a grid
- Simple Geometrical Intersection Graphs
- An approach to solving \(A^{k}=J-I\)
- Characterization of classical graph classes by weighted clique graphs
- Subgraph trees in graph theory
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- The maximum edit distance from hereditary graph properties
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Enumeration of the perfect sequences of a chordal graph
- Obstacle numbers of graphs
- The dynamic team forming problem: throughput and delay for unbiased policies
- A recognition algorithm for simple-triangle graphs
- Maximum area independent sets in disk intersection graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Maxclique and unit disk characterizations of strongly chordal graphs
- Hypergraph representation via axis-aligned point-subspace cover
- A new analysis of quasianalysis
- Hyperplanes of Squier's cube complexes
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Fixed cardinality stable sets
- Exact leaf powers
- Clique coloring EPT graphs on bounded degree trees
- Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
- A new family of proximity graphs: class cover catch digraphs
- Kneser ranks of random graphs and minimum difference representations
- The composition of semi-finished inventories at a solid board plant.
- Convex and isometric domination of (weak) dominating pair graphs
- Contact representations of planar graphs: extending a partial representation is hard
- Kneser ranks of random graphs and minimum difference representations
- Algorithmic graph theory and its applications
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- Graphs with the maximum or minimum number of 1-factors
- Computing the clique-separator graph for an interval graph in linear time
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
- Cube intersection concepts in median graphs
- A survey on the Intersection graphs of ideals of rings
- scientific article; zbMATH DE number 1786489 (Why is no real title available?)
- scientific article; zbMATH DE number 3855149 (Why is no real title available?)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Exactly hittable interval graphs
- A kind of intersection graph of vector space
- Clique trees of chordal graphs: leafage and 3-asteroidals
- The recognition of triangle graphs
- Paired threshold graphs
- On the hyperbolicity constant of circular-arc graphs
- Tractabilities and intractabilities on geometric intersection graphs
- Parikh word representability of bipartite permutation graphs
- Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem
- Reconstructing pedigrees: a stochastic perspective
- 3-coloring arrangements of line segments with 4 slopes is hard
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- Forced pairs in \(A\)-Stick graphs
- Global stabilization of similar formation via edge-based clique addition
- A new characterization of strongly chordal graphs
- Algorithmic graph theory and perfect graphs
- Extending partial representations of subclasses of chordal graphs
- A new class of weakly perfect graphs attached to S-acts
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- On m-bonacci intersection-sum graphs
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Adjacency matrices of probe interval graphs
- Random subcube intersection graphs. I: Cliques and covering
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- Maximal pivots on graphs with an application to gene assembly
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)
