The following pages link to On probe interval graphs (Q1281778):
Displaying 20 items.
- Block-graph width (Q534563) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On probe permutation graphs (Q967305) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- A characterization of cycle-free unit probe interval graphs (Q1028472) (← links)
- Sandwich and probe problems for excluding paths (Q1627855) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Chordal probe graphs (Q1887057) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- A characterization of 2-tree probe interval graphs (Q2509539) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
