Pages that link to "Item:Q924151"
From MaRDI portal
The following pages link to Partitioned probe comparability graphs (Q924151):
Displaying 8 items.
- Block-graph width (Q534563) (← links)
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- Graph partitioning applied to the logic testing of combinational circuits (Q1900143) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs (Q5895109) (← links)