Tolerance graphs
From MaRDI portal
Publication:798675
DOI10.1016/0166-218X(84)90016-7zbMATH Open0547.05054OpenAlexW4213116309WikidataQ106106890 ScholiaQ106106890MaRDI QIDQ798675FDOQ798675
Authors: Martin Charles Golumbic, William T. Trotter, Clyde l. Monma 
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90016-7
Recommendations
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- Title not available (Why is that?)
- Comparability graphs and intersection graphs
- A characterization of perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- Title not available (Why is that?)
- Title not available (Why is that?)
- On double and multiple interval graphs
- Extremal Values of the Interval Number of a Graph
Cited In (79)
- Asteroidal triples of moplexes
- Title not available (Why is that?)
- Recognizing threshold tolerance graphs in \(O(n^2)\) time
- A survey on pairwise compatibility graphs
- A recognition algorithm for simple-triangle graphs
- Pairwise compatibility graphs: a survey
- Efficient cross comparison graphs
- Title not available (Why is that?)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- Double-threshold permutation graphs
- Intuitionistic fuzzy tolerance graphs with application
- Domination graphs: Examples and counterexamples
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
- Fuzzy \(\phi\)-tolerance competition graphs
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- A new graph parameter to measure linearity
- Archimedean ϕ ‐tolerance graphs
- Cliques that are tolerance digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-fit coloring of bounded tolerance graphs
- Title not available (Why is that?)
- Towards a comprehensive theory of conflict-tolerance graphs
- A sufficient condition for boundedness of tolerance graphs
- On the perfect orderability of unions of two graphs
- Fuzzy intersection graphs
- Bipartable graphs
- On strict (outer-)confluent graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- On a problem concerning tolerance graphs
- NeST graphs
- On the intersection of tolerance and cocomparability graphs
- On the intersection of tolerance and cocomparability graphs
- Exact leaf powers
- On \(k\)-weak orders: Recognition and a tolerance result
- Generalizations of semiorders: A review note
- On the semi-perfect elimination
- Hereditary dominating pair graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A class of graphs each tolerance graph of which is a bounded one
- Triangulating graphs without asteroidal triples
- Minimal triangulations of graphs: a survey
- Weak bipolarizable graphs
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- Any complete preference structure without circuit admits an interval representation
- On linear and circular structure of (claw, net)-free graphs
- Recognizing graphs without asteroidal triples
- Trapezoid graphs and their coloring
- Graphs with special neighbourhood orderings of vertices
- Asteroidal triple-free graphs
- Query-competitive sorting with uncertainty
- Interval graphs and related topics
- Treelike comparability graphs
- Proper and unit bitolerance orders and graphs
- Triangulating multitolerance graphs
- A characterization of triangle-free tolerance graphs
- Bandwidth and density for block graphs
- Title not available (Why is that?)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Stability number and chromatic number of tolerance graphs
- Proper and unit tolerance graphs
- Chordal probe graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- A note on tolerance graph recognition
- Efficient local representations of graphs
- Constant tolerance intersection graphs of subtrees of a tree
- AT-free graphs: Linear bounds for the oriented diameter
- Tolerance competition graphs
- Bipartite tolerance orders
- Alternating orientation and alternating colouration of perfect graphs
- Neighborhood subtree tolerance graphs
- On randomized stopping points and perfect graphs
- Generalized neighbourhoods and a class of perfectly orderable graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
- Representations of graphs and networks (coding, layouts and embeddings)
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)
