Sciweavers

ENDM
2000
60views more  ENDM 2000»
14 years 8 days ago
The graph sandwich problem for 1-join composition is NP-complete
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
Celina M. Herrera de Figueiredo, Sulamita Klein, K...