Add to ORKGAn abdiff-tolerance competition graph, G = (V, E), is a graph for which each vertex i can be assigned a non-negative integer ti and at most \V\ subsets S-j of V can be found such that xy E E if and only if x and y lie in at least \t(x)-t(y)\ of the sets S-j. If G is not an abdiff-tolerance competition graph, it still is possible to find r \u3e \V\ subsets of V having the above property. The integer r - \V\ is called the abdiff-tolerance competition number. This paper determines those complete bipartite graphs which are abdiff-tolerance competition graphs and finds an asymptotic value for the abdiff-tolerance competition number of K-l,K-n
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
International audienceTolerance graphs model interval relations in such a way that intervals can tol...
We construct all six-element orders which are not 50%-tolerance orders. We show that a width-two ord...
An abdiff-tolerance competition graph, G = (V, E), is a graph for which each vertex i can be assigne...
An abdiff-tolerance competition graph, G = (V, E), is a graph for which each vertex i can be assigne...
The ø-tolerance competition graph is introduced as a generalization of the p-competition graphs defi...
AbstractThe ø-tolerance competition graph is introduced as a generalization of the p-competition gra...
AbstractLet φ be a symmetric function defined from N × N into N, where N denotes the nonnegative int...
Let φ be a symmetric function defined from ℕ × ℕ into ℕ, where ℕ denotes the nonnegative integers. G...
Let phi be a symmetric function defined from N x N into N, where N denotes the nonnegative integers....
A graph G = (V, E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of t...
Problem Definition Tolerance graphs model interval relations in such a way that intervals can toler...
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractWe consider tolerance graphs as defined by Golumbic, Monma, and Trotter (1984). These author...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
International audienceTolerance graphs model interval relations in such a way that intervals can tol...
We construct all six-element orders which are not 50%-tolerance orders. We show that a width-two ord...
An abdiff-tolerance competition graph, G = (V, E), is a graph for which each vertex i can be assigne...
An abdiff-tolerance competition graph, G = (V, E), is a graph for which each vertex i can be assigne...
The ø-tolerance competition graph is introduced as a generalization of the p-competition graphs defi...
AbstractThe ø-tolerance competition graph is introduced as a generalization of the p-competition gra...
AbstractLet φ be a symmetric function defined from N × N into N, where N denotes the nonnegative int...
Let φ be a symmetric function defined from ℕ × ℕ into ℕ, where ℕ denotes the nonnegative integers. G...
Let phi be a symmetric function defined from N x N into N, where N denotes the nonnegative integers....
A graph G = (V, E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of t...
Problem Definition Tolerance graphs model interval relations in such a way that intervals can toler...
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractWe consider tolerance graphs as defined by Golumbic, Monma, and Trotter (1984). These author...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
International audienceTolerance graphs model interval relations in such a way that intervals can tol...
We construct all six-element orders which are not 50%-tolerance orders. We show that a width-two ord...