Pages that link to "Item:Q3519195"
From MaRDI portal
The following pages link to Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs (Q3519195):
Displaying 15 items.
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Regularity of binomial edge ideals of chordal graphs (Q2044164) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← 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)