1 problem

Polynomial-time recognition conjecture for APUD(1,1)
APUD(1,1) recognition conjecture. Given a graph $G$ , it can be determined whether $G\in\mathrm{APUD}(1,1)$ in polynomial time.
openFrom paperscomputational-complexity intersection-graphs recognition-algorithms
0 responses
10

Polynomial-time recognition conjecture for APUD(1,1)