A characterization of chain probe graphs

Martin C. Golumbic, Frédéric Maffray, Grégory Morel

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)175-183
Number of pages9
JournalAnnals of Operations Research
Issue number1
StatePublished - Aug 2011

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'A characterization of chain probe graphs'. Together they form a unique fingerprint.

Cite this