Probe threshold and probe trivially perfect graphs
From MaRDI portal
Publication:1034600
DOI10.1016/j.tcs.2009.06.029zbMath1194.68167OpenAlexW2038410225MaRDI QIDQ1034600
Daniel Bayer, H. N. de Ridder, Van Bang Le
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.029
Related Items
A unified approach to recognize squares of split graphs ⋮ Good characterizations and linear time recognition for 2-probe block graphs ⋮ Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs ⋮ The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ Two characterizations of chain partitioned probe graphs ⋮ Recognition of Probe Ptolemaic Graphs ⋮ On the bi-enhancement of chordal-bipartite probe graphs ⋮ Characterizing and recognizing probe block graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioned probe comparability graphs
- Strict 2-threshold graphs
- Trivially perfect graphs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Chordal probe graphs
- Threshold graphs and related topics
- Quasi-threshold graphs
- Efficient and Practical Algorithms for Sequential Modular Decomposition
- Characterisations and Linear-Time Recognition of Probe Cographs
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
- Bithreshold Graphs
- Threshold characterization of graphs with dilworth number two
- The Comparability Graph of a Tree
- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
- A Note on "The Comparability Graph of a Tree"
- Computing and Combinatorics
- Difference graphs
- Theory and Applications of Models of Computation
This page was built for publication: Probe threshold and probe trivially perfect graphs
