Probe threshold and probe trivially perfect graphs
type: Item
instance of: scholarly article
title: Probe threshold and probe trivially perfect graphs
zbMATH Open document ID: 1194.68167
author: Daniel Bayer
author: Van Bang Le
author: H. N. de Ridder
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5626952
zbMATH Keywords: probe graphs
zbMATH Keywords: probe threshold
zbMATH Keywords: probe interval
zbMATH Keywords: probe trivially perfect
zbMATH Keywords: graph class
zbMATH Keywords: 2-SAT
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.06.029
OpenAlex ID: W2038410225
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Threshold characterization of graphs with dilworth number two
cites work: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
cites work: Theory and Applications of Models of Computation
cites work: Partitioned probe comparability graphs
cites work: Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
cites work: Computing and Combinatorics
cites work: Q4165164
cites work: Q4954442
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: Trivially perfect graphs
cites work: Chordal probe graphs
cites work: Bithreshold Graphs
cites work: Difference graphs
cites work: Characterisations and Linear-Time Recognition of Probe Cographs
cites work: Q5387698
cites work: Strict 2-threshold graphs
cites work: Threshold graphs and related topics
cites work: The Comparability Graph of a Tree
cites work: A Note on "The Comparability Graph of a Tree"
cites work: Quasi-threshold graphs
DOI: 10.1016/J.TCS.2009.06.029
description: scientific article; zbMATH DE number 5626952