Pages that link to "Item:Q1932454"
From MaRDI portal
The following pages link to Recognition of probe distance-hereditary graphs (Q1932454):
Displaying 6 items.
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- The path-partition problem in bipartite distance-hereditary graphs (Q1272711) (← links)
- Graph classes between parity and distance-hereditary graphs (Q1302157) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Bipartite almost distance-hereditary graphs (Q2470455) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)