The following pages link to (Q4829024):
Displaying 17 items.
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Partitioned probe comparability graphs (Q924151) (← 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)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs (Q5895109) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
