Five strains isolated from root nodules of Lablab purpureus and Arachis hypogaea grown in
the Anhui and Sichuan provinces of China were classified as members of the genus …

We introduce a notion of simultaneity for any class of graphs with an intersection
representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which …

Let C be a class of graphs. A graph G=(V, E) is C-probe if V (G) can be partitioned into two
sets: non-probes N and probes P, where N is an independent set and new edges may be …

In this paper we look at the problem of adjacency labeling of graphs. Given a family of
undirected graphs the problem is to determine an encoding-decoding scheme for each …

Let CC be a class of graphs. A graph G=(V, E) G=(V, E) is CC–probe if V (G) can be
partitioned into two sets: non-probes NN and probes PP, where NN is an independent set …

We introduce the simultaneous representation problem, defined for any graph class \calC
characterized in terms of representations, eg any class of intersection graphs. Two graphs G …

Some graphs admit drawings in the Euclidean k-space in such a (natural) way, that edges
are represented as line segments of unit length. Such embeddings are called k-dimensional …

Let G denote a graph class. An undirected graph G is called a probe G graph if one can
make G a graph in G by adding edges between vertices in some independent set of G. By …

In this paper we look at the problem of adjacency labeling of graphs. Given a family of
undirected graphs the problem is to determine an encoding-decoding scheme for each …

Abstract A graph G=(V, E) is called a probe graph of graph class G if V can be partitioned
into two sets P (probes) and N (nonprobes), where N is an independent set, such that G can …