Tolerance graphs

From MaRDI portal
Publication:798675

DOI10.1016/0166-218X(84)90016-7zbMath0547.05054OpenAlexW4213116309WikidataQ106106890 ScholiaQ106106890MaRDI QIDQ798675

Martin Charles Golumbic, William T. jun. 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




Related Items (69)

NeST graphsMinimal triangulations of graphs: a surveyBipartable graphsOn randomized stopping points and perfect graphsBipartite tolerance ordersAlternating orientation and alternating colouration of perfect graphsChordal probe graphsA note on tolerance graph recognitionA class of graphs each tolerance graph of which is a bounded oneThe \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a cliqueProper and unit tolerance graphsComputing a dominating pair in an asteroidal triple-free graph in linear timePairwise Compatibility Graphs: A SurveyGeneralized neighbourhoods and a class of perfectly orderable graphsFuzzy intersection graphsDouble-threshold permutation graphsAny complete preference structure without circuit admits an interval representationTrapezoid graphs and their coloringWeak bipolarizable graphsAlgorithmic aspects of intersection graphs and representation hypergraphsTriangulating graphs without asteroidal triplesRecognizing graphs without asteroidal triplesQuery-competitive sorting with uncertaintyOn the perfect orderability of unions of two graphsProper and unit bitolerance orders and graphsOn \(k\)-weak orders: Recognition and a tolerance resultCliques that are tolerance digraphsIntuitionistic fuzzy tolerance graphs with applicationGeneralizations of semiorders: A review noteRecognizing simple-triangle graphs by restricted 2-chain subgraph coverRecognizing Threshold Tolerance Graphs in $$O(n^2)$$ TimeA recognition algorithm for simple-triangle graphsTriangulating multitolerance graphsOn the intersection of tolerance and cocomparability graphsA sufficient condition for boundedness of tolerance graphsAsteroidal triple-free graphsOn linear and circular structure of (claw, net)-free graphsFuzzy \(\phi\)-tolerance competition graphsOn strict (outer-)confluent graphsA new graph parameter to measure linearityHereditary dominating pair graphsRepresentations of graphs and networks (coding, layouts and embeddings)Stability number and chromatic number of tolerance graphsA linear time algorithm to compute a dominating path in an AT-free graphLinear time algorithms for dominating pairs in asteroidal triple-free graphsAn intersection model for multitolerance graphs: efficient algorithms and hierarchyOn a problem concerning tolerance graphsFirst-fit coloring of bounded tolerance graphsTowards a comprehensive theory of conflict-tolerance graphsRecognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphsConstant tolerance intersection graphs of subtrees of a treeDomination graphs: Examples and counterexamplesA characterization of triangle-free tolerance graphsAsteroidal triples of moplexesExact leaf powersOn the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphsNeighborhood subtree tolerance graphsNew Geometric Representations and Domination Problems on Tolerance and Multitolerance GraphsTreelike comparability graphsOn the semi-perfect eliminationDominating the complements of bounded tolerance graphs and the complements of trapezoid graphsAT-free graphs: Linear bounds for the oriented diameterBandwidth and density for block graphsCharacterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posetsEfficient Local Representations of GraphsA survey on pairwise compatibility graphsCharacterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability GraphsInterval graphs and related topicsGraphs with special neighbourhood orderings of vertices



Cites Work


This page was built for publication: Tolerance graphs