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 …

In a recent paper, we introduced the simultaneous representation problem (defined for any
graph class \calC) and studied the problem for chordal, comparability and permutation …

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 …

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 …

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 …

La classe des graphes sans P5, c'est-à-dire des graphes ne contenant pas de chaîne
induite à cinq sommets, est d'un intérêt particulier en théorie des graphes. Il s' agit en effet …

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 …

In a partitioned probe graph the vertex set is partitioned into probes and non-probes, such
that the set of non-probes is an independent set. A probe proper interval graph is the …