Pages that link to "Item:Q3508570"
From MaRDI portal
The following pages link to Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570):
Displaying 9 items.
- Certifying algorithms (Q465678) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← links)
