@inbook{14f092a73223462080860b66a1c3d8d8,

title = "Chordal probe graphs: (Extended Abstract)",

abstract = "In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P(probes) and N(non-probes) where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We show that a chordal probe graph may contain neither an odd-length chordless cycle nor the complement of a chordless cycle. We give polynomial time recognition algorithms for the subfamily of weakly chordal graphs which are also chordal probe, first in the case of a fixed given partition of the vertices into probes and non-probes, and second in the more general case where no partition is given.",

author = "Golumbic, {Martin Charles} and Marina Lipshteyn",

year = "2003",

doi = "10.1007/978-3-540-39890-5_22",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "249--260",

editor = "Bodlaender, {Hans L.}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}