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 vertex of SL is adjacent to vertex of AR SR; no vertex of SR is adjacent to a vertex of AL SL. The graph sandwich problem for 1-join composition is de

• Type: Journal
• Year: 2000
• Where: ENDM
• Authors: Celina M. Herrera de Figueiredo, Sulamita Klein, Kristina Vuskovic
• Keywords: 1-join Composition, ENDM 2000, Graph Sandwich Problem, Nonempty Sets