๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Composites Germany joins the EuCIA

Book ID
124143444
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
209 KB
Volume
58
Category
Article
ISSN
0034-3617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The graph sandwich problem for 1-join co
The graph sandwich problem for 1-join composition is NP-complete
โœ Celina M.H. de Figueiredo; Sulamita Klein; Kristina Vuลกkoviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets \(A_{L}, A_{R}, S_{L}\) and \(S_{R}\) such that: every vertex of \(A_{L}\) is adjacent to every vertex of \(A_{R} ;\) no vertex of \(S_{L}\) is adjacent to a vertex of \(A_{R} \cup S_{R} ;\) no vertex of \(S