The following pages link to Chordal probe graphs (Q1887057):
Displaying 18 items.
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Terminal chords in connected chord diagrams (Q679656) (← links)
- On probe permutation graphs (Q967305) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← 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)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs (Q5895109) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902526) (← links)
