The following pages link to On probe permutation graphs (Q967305):
Displaying 13 items.
- Block-graph width (Q534563) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Chordal probe graphs (Q1887057) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Characterizing and recognizing probe block graphs (Q2513611) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Probe interval and probe unit interval graphs on superclasses of cographs (Q2840732) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- STACS 2005 (Q5710704) (← links)
