Add to ORKGA graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe (unit) interval graphs form a superclass of (unit) interval graphs. Probe interval graphs were introduced by Zhang for an application concerning the physical mapping of DNA in the human genome project. The main results of this article are minimal forbidden induced subgraphs characterizations of probe interval and probe unit interval graphs within two superclasses of cographs: P4-tidy graphs and tree-cographs. Furthermore, we i...
AbstractIn this paper, we introduce the class of chordal probe graphs which are a generalization of ...
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and...
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exis...
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe ve...
AbstractA graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and n...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
AbstractA graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and n...
AbstractProbe interval graphs (PIGs) are used as a generalization of interval graphs in physical map...
AbstractProbe interval graphs have been introduced in the physical mapping and sequencing of DNA as ...
AbstractProbe interval graphs (PIGs) are used as a generalization of interval graphs in physical map...
A probe interval graph is a graph with vertex partition P ∪ N and to each vertex v there corresponds...
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real li...
AbstractIn this paper, we introduce the class of chordal probe graphs which are a generalization of ...
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and...
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exis...
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe ve...
AbstractA graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and n...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
AbstractA graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and n...
AbstractProbe interval graphs (PIGs) are used as a generalization of interval graphs in physical map...
AbstractProbe interval graphs have been introduced in the physical mapping and sequencing of DNA as ...
AbstractProbe interval graphs (PIGs) are used as a generalization of interval graphs in physical map...
A probe interval graph is a graph with vertex partition P ∪ N and to each vertex v there corresponds...
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real li...
AbstractIn this paper, we introduce the class of chordal probe graphs which are a generalization of ...
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and...
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exis...