Details

Autor(en) / Beteiligte

• Gurski, Frank
• Wanke, Egon

Titel

On the relationship between NLC-width and linear NLC-width

Ist Teil von

• Theoretical computer science, 2005-11, Vol.347 (1), p.76-89

Ort / Verlag

Amsterdam: Elsevier B.V

Erscheinungsjahr

2005

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• In this paper, we consider NLC-width, NLCT-width, and linear NLC-width bounded graphs. We show that the set of all complete binary trees has unbounded linear NLC-width and that the set of all co-graphs has unbounded NLCT-width. Since trees have NLCT-width 3 and co-graphs have NLC-width 1, it follows that the family of linear NLC-width bounded graph classes is a proper subfamily of the family of NLCT-width bounded graph classes and that the family of NLCT-width bounded graph classes is a proper subfamily of the family of NLC-width bounded graph classes.