Towards a comprehensive theory of conflict-tolerance graphs
type: Item
instance of: scholarly article
title: Towards a comprehensive theory of conflict-tolerance graphs
zbMATH Open document ID: 1292.05219
author: Robert E. Jamison
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6109921
zbMATH Keywords: intersection graphs
zbMATH Keywords: interval graphs
zbMATH Keywords: graph representations
zbMATH Keywords: minimal forbidden subgraphs
zbMATH Keywords: trees
MaRDI profile type: Publication
full work available at URL: j.dam.2011.12.026
OpenAlex ID: W2030634141
cites work: Q5570136
cites work: Interval Graphs with Containment Restrictions
cites work: Graph Classes: A Survey
cites work: Q3581911
cites work: Maximum independent set and maximum clique algorithms for overlap graphs
cites work: Q4165164
cites work: What Is between Chordal and Weakly Chordal Graphs?
cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs
cites work: Intersection representation of complete unbalanced bipartite graphs
cites work: \(K_{1,3}\)-subdivision tolerance representations of cycles
cites work: Q5441579
cites work: Tree representations of graphs
cites work: Set intersection representations for almost all graphs
cites work: Subtree filament graphs are subtree overlap graphs
cites work: The Representation of a Graph by Set Intersections
cites work: Q4193514
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Edge and vertex intersection of paths in a tree
cites work: The edge intersection graphs of paths in a tree
cites work: Rank‐tolerance graph classes
cites work: Archimedean ϕ ‐tolerance graphs
cites work: Equivalences and the complete hierarchy of intersection graphs of paths in a tree
cites work: Representing edge intersection graphs of paths on degree 4 trees
cites work: The \(k\)-edge intersection graphs of paths in a tree
cites work: Intersection models of weakly chordal graphs
cites work: Q3322150
cites work: Tolerance graphs
cites work: Comparability graphs and intersection graphs
cites work: Q4828541
cites work: On the chromatic number of multiple interval graphs and overlap graphs
cites work: \(\phi\)-threshold and \(\phi\)-tolerance chain graphs
cites work: Q4873748
cites work: General results on tolerance intersection graphs
cites work: Q3615948
cites work: Q3636145
cites work: Q3581872
cites work: Tolerance intersection graphs on binary trees with constant tolerance 3
cites work: Constant tolerance representations of graphs in trees
cites work: Constant tolerance intersection graphs of subtrees of a tree
cites work: Q3429500
cites work: Q3581880
cites work: Q3429538
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: A short proof of Sperner's lemma
cites work: Efficient algorithms for finding maximum cliques of an overlap graph
cites work: Topics in Intersection Graph Theory
cites work: Q3320434
cites work: Threshold tolerance graphs
cites work: Q3836524
cites work: Q5588433
cites work: Q5588432
cites work: Triangulated edge intersection graphs of paths in a tree
cites work: A characterization of Robert's inequality for boxicity
cites work: Representations of chordal graphs as subtrees of a tree
cites work: Q5311854
DOI: 10.1016/J.DAM.2011.12.026