Tolerance graphs
From MaRDI portal
Publication:798675
Recommendations
Cites work
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A characterization of perfect graphs
- Comparability graphs and intersection graphs
- Extremal Values of the Interval Number of a Graph
- Normal hypergraphs and the perfect graph conjecture
- On double and multiple interval graphs
- Representation of a finite graph by a set of intervals on the real line
Cited in
(78)- Chordal probe graphs
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- Trapezoid graphs and their coloring
- On strict (outer-)confluent graphs
- Proper and unit tolerance graphs
- Generalizations of semiorders: A review note
- Efficient local representations of graphs
- On randomized stopping points and perfect graphs
- Triangulating graphs without asteroidal triples
- Fuzzy intersection graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- On the semi-perfect elimination
- Minimal triangulations of graphs: a survey
- Cliques that are tolerance digraphs
- Query-competitive sorting with uncertainty
- Bipartable graphs
- Exact leaf powers
- Bandwidth and density for block graphs
- A characterization of triangle-free tolerance graphs
- Generalized neighbourhoods and a class of perfectly orderable graphs
- scientific article; zbMATH DE number 1735726 (Why is no real title available?)
- Towards a comprehensive theory of conflict-tolerance graphs
- On linear and circular structure of (claw, net)-free graphs
- Recognizing graphs without asteroidal triples
- Any complete preference structure without circuit admits an interval representation
- On a problem concerning tolerance graphs
- Treelike comparability graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- A sufficient condition for boundedness of tolerance graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
- On the perfect orderability of unions of two graphs
- Weak bipolarizable graphs
- Hereditary dominating pair graphs
- Graphs with special neighbourhood orderings of vertices
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- On \(k\)-weak orders: Recognition and a tolerance result
- Tolerance competition graphs
- Stability number and chromatic number of tolerance graphs
- Constant tolerance intersection graphs of subtrees of a tree
- A class of graphs each tolerance graph of which is a bounded one
- Alternating orientation and alternating colouration of perfect graphs
- On the intersection of tolerance and cocomparability graphs
- Interval graphs and related topics
- Bipartite tolerance orders
- AT-free graphs: Linear bounds for the oriented diameter
- Asteroidal triple-free graphs
- NeST graphs
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- On the intersection of tolerance and cocomparability graphs
- Proper and unit bitolerance orders and graphs
- scientific article; zbMATH DE number 840698 (Why is no real title available?)
- Neighborhood subtree tolerance graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- First-fit coloring of bounded tolerance graphs
- Triangulating multitolerance graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- A note on tolerance graph recognition
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- On characterizing proper max-point-tolerance graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Double-threshold permutation graphs
- Efficient cross comparison graphs
- Recognizing threshold tolerance graphs in \(O(n^2)\) time
- scientific article; zbMATH DE number 29611 (Why is no real title available?)
- scientific article; zbMATH DE number 1792564 (Why is no real title available?)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- A survey on pairwise compatibility graphs
- Domination graphs: Examples and counterexamples
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Asteroidal triples of moplexes
- Intuitionistic fuzzy tolerance graphs with application
- Pairwise compatibility graphs: a survey
- A recognition algorithm for simple-triangle graphs
- Archimedean ϕ ‐tolerance graphs
- Fuzzy \(\phi\)-tolerance competition graphs
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
This page was built for publication: Tolerance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798675)
