[Indifference graphs](https://en.wikipedia.org/wiki/Indifference_graph) are those graphs $G=(V,E)$ for which there exists a real-valued function $f$ defined on $V(G)$ such that, if $u$ and $v$ are distinct vertices, $|f(u)−f(v)| \lt 1$ if and only if $\{u,v\}\in E$. 
A famous result of [Roberts (1969)](http://www.ams.org/mathscinet-getitem?mr=252267) shows that this graphs are equivalent to the unit interval graphs (or the proper interval graphs), and they are further equivalent to the $K\_{1,3}$-free interval graphs. 


I need know about those graphs $G=(V,E)$ for which there exists two real-valued function $f$ and $g$ defined on $V(G)$ such that, if $u$ and $v$ are distinct vertices, $|f(u)−f(v)| \lt |g(u)−g(v)|$ if and only if $\{u,v\}\in E$. [ISGCI](http://www.graphclasses.org) didn't know of such a class. 



> 
> Have this class of graphs been studied before? What kind of properties do they have? Are they perhaps equivalent to some well-known (or a better known) graph class?
> 
> 
> 



Have this generalization of Indifference graphs been studied before?
Seeing that indifference graphs are the same as unit interval graphs is very easy: we simply identify each vertex $v$ with a unit interval centred at $f(v)$.


We can try to do something similar here. Identify each vertex $v$ with the point $(f(v), g(v))$ in $\mathbb R^2$. Then two points are adjacent if and only if the line joining them is closer to vertical than horizontal. Rotating the picture 45 degrees anticlockwise, two points are adjacent if and only if the line joining them has negative slope. If we assume that in this rotated picture no $x$ or $y$ coordinate is repeated, then this is precisely the definition of a [permutation graph](https://en.wikipedia.org/wiki/Permutation_graph). 


If some coordinates are repeated, then we can perturb the points slightly so that the associated vertical or horizontal lines joining pairs of points become lines of positive slope, so we also get a permutation graph in this case.


