On the recognition of probe graphs of some self-complementary classes of perfect graphs
From MaRDI portal
Recommendations
Cited in
(17)- Probe threshold and probe trivially perfect graphs
- On the forbidden induced subgraph probe and sandwich problems
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- On the probe problem for (r, )-well-coveredness
- Characterisations and Linear-Time Recognition of Probe Cographs
- Probe Ptolemaic Graphs
- Probe split graphs
- Adjacency matrices of probe interval graphs
- On the forbidden induced subgraph sandwich problem
- A characterization of chain probe graphs
- Finding d-cuts in probe H-free graphs
- Computing subset vertex covers in H-free graphs
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
- Partitioned probe comparability graphs
- On probe permutation graphs
- On the bi-enhancement of chordal-bipartite probe graphs
This page was built for publication: On the recognition of probe graphs of some self-complementary classes of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717004)