scientific article; zbMATH DE number 2117210
From MaRDI portal
Recommendations
- Algorithmic graph theory and its applications
- Publication:4862906
- Tolerance graphs
- Neighborhood subtree tolerance graphs
- scientific article; zbMATH DE number 1439486
- Threshold tolerance graphs
- scientific article; zbMATH DE number 512915
- On a problem concerning tolerance graphs
- Unit and proper bitolerance digraphs
- scientific article; zbMATH DE number 867635
Cited in
(79)- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Mutual exclusion scheduling with interval graphs or related classes. I
- Two-colorable graph states with maximal Schmidt measure
- Cubicity of threshold graphs
- Intersection models of weakly chordal graphs
- Stability number and chromatic number of tolerance graphs
- NeST graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Fuzzy \(\phi\)-tolerance competition graphs
- Recent results on containment graphs of paths in a tree
- Towards a comprehensive theory of conflict-tolerance graphs
- Dyadic representations of graphs
- A vertex ordering characterization of simple-triangle graphs
- Chordal probe graphs
- Double-threshold permutation graphs
- Dimension of restricted classes of interval orders
- Constant threshold intersection graphs of orthodox paths in trees
- A recognition algorithm for simple-triangle graphs
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- Tolerance orders of open and closed unit intervals
- Interval orders with two interval lengths
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
- Helly EPT graphs on bounded degree trees: characterization and recognition
- Intersection graphs of orthodox paths in trees
- Characterizing interval graphs which are probe unit interval graphs
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- Recognition of probe proper interval graphs
- Co-TT graphs and a characterization of split co-TT graphs
- The k-edge intersection graphs of paths in a tree
- Mutual exclusion scheduling with interval graphs or related classes. II
- A matrix characterization of interval and proper interval graphs
- A characterization of triangle-free tolerance graphs
- Range of the fractional weak discrepancy function
- A characterization of 2-tree probe interval graphs
- PTAS for densest \(k\)-subgraph in interval graphs
- Containment graphs and posets of paths in a tree: wheels and partial wheels
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Recognizing threshold tolerance graphs in O(n^2) time
- Induced separation dimension
- On containment graphs of paths in a tree
- Algorithmic graph theory and its applications
- A polynomial algorithm for the k-cluster problem on the interval graphs
- Max point-tolerance graphs
- scientific article; zbMATH DE number 29611 (Why is no real title available?)
- A sufficient condition for boundedness of tolerance graphs
- scientific article; zbMATH DE number 1735726 (Why is no real title available?)
- The recognition of triangle graphs
- Counting independent sets in a tolerance graph
- scientific article; zbMATH DE number 1439486 (Why is no real title available?)
- On central max-point-tolerance graphs
- Generating Posets Beyond N
- Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs
- Intersection graphs of homothetic polygons
- What Is between Chordal and Weakly Chordal Graphs?
- First-fit coloring of bounded tolerance graphs
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- Efficient local representations of graphs
- scientific article; zbMATH DE number 7666852 (Why is no real title available?)
- The \(t\)-discrepancy of a poset
- Multithreshold multipartite graphs
- Adjacency matrices of probe interval graphs
- An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
- A characterization of chain probe graphs
- Containment orders – a lifelong journey
- Temporal graph realization from fastest paths
- A note on the threshold numbers of cycles
- Graph classes equivalent to 12-representable graphs
- Veto interval graphs and variations
- m-step inverse fuzzy mixed competition graphs
- On some subclasses of oriented catch digraphs
- The induced separation dimension of a graph
- Realizing temporal transportation trees
- Tolerance graphs
- \(\lambda\)-coloring matrogenic graphs
- On the intersection of tolerance and cocomparability graphs
- Forbidden substructure for interval digraphs/bigraphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Exact leaf powers
- On the bi-enhancement of chordal-bipartite probe graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828541)
