Pages that link to "Item:Q2513611"
From MaRDI portal
The following pages link to Characterizing and recognizing probe block graphs (Q2513611):
Displaying 5 items.
- On the complete width and edge clique cover problems (Q721937) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Betti numbers of edge ideals of some split graphs (Q5124578) (← links)
- A note proving the nullity of block graphs is unbounded (Q6646411) (← links)
