On slim graphs, even pairs, and star-cutsets
Discrete Mathematics
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Graph classes: a survey
A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
SIAM Journal on Discrete Mathematics
A good characterization of cograph contractions
Journal of Graph Theory
Forbidden induced subgraph characterization of cograph contractions
Journal of Graph Theory
2-Tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics
Partitioned probe comparability graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science
Probe distance-hereditary graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Recognition of probe ptolemaic graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Computer Science Review
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics
Recognition of probe proper interval graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and G can be extended to a cograph by adding edges between certain non-probes. A partitioned probe cograph is a probe cograph with a given partition in N and P. We characterise probe cographs in several ways. Moreover, we characterise partitioned probe cographs in terms of five forbidden induced subgraphs. Using the forbidden induced subgraph characterisation, we give a linear-time recognition algorithm for probe cographs, improving the recent quadratic-time recognition algorithm by Chandler et al. Our algorithm is a modification of the linear-time recognition algorithm for cographs by Corneil et al.