The following pages link to Computing and Combinatorics (Q5717004):
Displaying 14 items.
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On probe permutation graphs (Q967305) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
