Forbidden subgraph characterization of bipartite unit probe interval graphs

نویسندگان

  • David E. Brown
  • Larry J. Langley
چکیده

A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another properly) the graph is a unit probe interval graph. We characterize, via a list of minimal forbidden induced subgraphs, and no a priori partition of vertices into probes and nonprobes, the class of bipartite unit probe interval graphs and present a linear time recognition algorithm for them which is based on this characterization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

-tree probe interval graphs have a large obstruction set

Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition of if vertices of correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in ; vertices belonging to are called probes and vertices belonging t...

متن کامل

2-Tree probe interval graphs have a large obstruction set

Probe interval graphs (PIGs) are used as a generalization of interval graphs in physical mapping of DNA.G= (V ,E) is a probe interval graph (PIG) with respect to a partition (P,N) ofV if vertices of G correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in P; vertices belonging to P are called pro...

متن کامل

A characterization of k-trees that are interval p-graphs

Interval p-graphs were introduced by Brown et al. in 2002 as a generalization of interval bigraphs [D.E. Brown, S.C. Flink and J.R. Lundgren, Congr. Numer. 157 (2002), 79–93]. Little work has been done towards characterizing them. For interval bigraphs the only known forbidden subgraph characterization is for trees. As it appears to be quite difficult to find a forbidden subgraph characterizati...

متن کامل

On minimal forbidden subgraph characterizations of balanced graphs

A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...

متن کامل

Towards a characterization of bipartite switching classes by means of forbidden subgraphs

We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2012