AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f: V → F such that uv ϵ E if and only if f(u)∩f(v) ≠ Ø. It is proved that if G is a Countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. Similar results are also proved when intervals are required to have unit length
The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vert...
AbstractThe interval number of a graph G, denoted i(G), is the least positive integer t for which G ...
AbstractIn this paper, we compare the computability and complexity of a continuous real function F w...
AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bi...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
AbstractGiven an interval representation of an interval graph G, an interval is an end interval if i...
AbstractWe consider the following question: Given a family of sets, is there a positive integer, t, ...
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interv...
AbstractWe characterize those interval graphs G with the property that, for every vertex v, there ex...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
AbstractIt is shown that the interval number of a graph on n vertices is at most [14(n+1)], and this...
AbstractThe interval number of a simple undirected graph G, denoted i(G), is the least non-negative ...
AbstractA representation f of a graph G is a mapping f which assigns to each vertex of G a non-empty...
AbstractThree results on the interval number of a graph on n vertices are presented. (1) The interva...
The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vert...
AbstractThe interval number of a graph G, denoted i(G), is the least positive integer t for which G ...
AbstractIn this paper, we compare the computability and complexity of a continuous real function F w...
AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bi...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
AbstractGiven an interval representation of an interval graph G, an interval is an end interval if i...
AbstractWe consider the following question: Given a family of sets, is there a positive integer, t, ...
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interv...
AbstractWe characterize those interval graphs G with the property that, for every vertex v, there ex...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
AbstractIt is shown that the interval number of a graph on n vertices is at most [14(n+1)], and this...
AbstractThe interval number of a simple undirected graph G, denoted i(G), is the least non-negative ...
AbstractA representation f of a graph G is a mapping f which assigns to each vertex of G a non-empty...
AbstractThree results on the interval number of a graph on n vertices are presented. (1) The interva...
The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vert...
AbstractThe interval number of a graph G, denoted i(G), is the least positive integer t for which G ...
AbstractIn this paper, we compare the computability and complexity of a continuous real function F w...