The following pages link to STACS 2005 (Q5710704):
Displaying 8 items.
- Partitioned probe comparability graphs (Q924151) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
