&phgr;-threshold and &fgr;-tolerance chain graphs
Discrete Applied Mathematics
Set intersection representations for almost all graphs
Journal of Graph Theory
Intersection representation of complete unbalanced bipartite graphs
Journal of Combinatorial Theory Series B
Tolerance intersection graphs on binary trees with constant tolerance
Discrete Mathematics
Maximum weight independent sets and cliques in intersection graphs of filaments
Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Tree representations of graphs
European Journal of Combinatorics
Subtree filament graphs are subtree overlap graphs
Information Processing Letters
The k-edge intersection graphs of paths in a tree
Discrete Applied Mathematics
Archimedean φ -tolerance graphs
Journal of Graph Theory
Journal of Graph Theory
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Discrete Applied Mathematics
What Is between Chordal and Weakly Chordal Graphs?
Graph-Theoretic Concepts in Computer Science
Intersection models of weakly chordal graphs
Discrete Applied Mathematics
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
Many graph classes are defined by the following paradigm: each vertex is assigned something measuring its size and something measuring its tolerance. If the combined sizes exceed the combined tolerances, then there is a conflict and the corresponding vertices are adjacent in a conflict-tolerance graph. This paper attempts a broad formalization of the above notion. The goal is to provide a framework for classifying, comparing, and developing interesting models of graph representations.