Towards a comprehensive theory of conflict-tolerance graphs
From MaRDI portal
Publication:1759850
DOI10.1016/J.DAM.2011.12.026zbMATH Open1292.05219OpenAlexW2030634141MaRDI QIDQ1759850FDOQ1759850
Authors: Robert E. Jamison 
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.026
Recommendations
Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Topics in Intersection Graph Theory
- Title not available (Why is that?)
- Graph Classes: A Survey
- Intersection models of weakly chordal graphs
- Edge and vertex intersection of paths in a tree
- Triangulated edge intersection graphs of paths in a tree
- Comparability graphs and intersection graphs
- Representing edge intersection graphs of paths on degree 4 trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- A Characterization of Comparability Graphs and of Interval Graphs
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- The \(k\)-edge intersection graphs of paths in a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- A recognition algorithm for the intersection graphs of paths in trees
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Threshold tolerance graphs
- On the chromatic number of multiple interval graphs and overlap graphs
- A short proof of Sperner's lemma
- Tree representations of graphs
- General results on tolerance intersection graphs
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Tolerance graphs
- The Representation of a Graph by Set Intersections
- Constant tolerance intersection graphs of subtrees of a tree
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Title not available (Why is that?)
- Maximum independent set and maximum clique algorithms for overlap graphs
- A characterization of Robert's inequality for boxicity
- Title not available (Why is that?)
- \(\phi\)-threshold and \(\phi\)-tolerance chain graphs
- Subtree filament graphs are subtree overlap graphs
- What Is between Chordal and Weakly Chordal Graphs?
- Efficient algorithms for finding maximum cliques of an overlap graph
- Intersection representation of complete unbalanced bipartite graphs
- Constant tolerance representations of graphs in trees
- A general theory of graph representations
- Title not available (Why is that?)
- A conflict-tolerance paradigm for representations of graphs
- On intersection graphs of 2-matchings in cubic graphs
- \(K_{1,3}\)-subdivision tolerance representations of cycles
- Title not available (Why is that?)
- The parameter space of mix graphs
- Title not available (Why is that?)
- Efficient cross comparison graphs
- Interval Graphs with Containment Restrictions
- Set intersection representations for almost all graphs
- Archimedean ϕ ‐tolerance graphs
- Caterpillar tolerance representations of cycles
- Rank‐tolerance graph classes
Cited In (7)
This page was built for publication: Towards a comprehensive theory of conflict-tolerance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759850)
