A characterization of chain probe graphs

@article{Golumbic2011ACO,
  title={A characterization of chain probe graphs},
  author={Martin Charles Golumbic and Fr{\'e}d{\'e}ric Maffray and Gr{\'e}gory Morel},
  journal={Annals OR},
  year={2011},
  volume={188},
  pages={175-183}
}
A chain probe graph is a graph that admits an independent set S of vertices and a set F of pairs of elements of S such that G + F is a chain graph (i.e., a 2K2-free bipartite graph). We show that chain probe graphs are exactly the bipartite graphs that do not contain as an induced subgraph a member of a family of six forbidden subgraphs, and deduce an O(n2) recognition algorithm. Given a class C of graphs, a graph G = (V ,E) is said to be a C probe graph if there exists an independent set of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Cycle-bicolorable graphs and triangulating chordal

  • M. C. Golumbic, M. Lipshteyn
  • Proc. SODA’04,
  • 2007

Tolerance graphs

  • M. C. Golumbic, A. N. Trenk
  • Journal of Algorithms,
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…