The NLC-width and clique-width for powers of graphs of bounded tree-width

DOI10.1016/j.dam.2008.08.031zbMath1173.05342MaRDI QIDQ1028448

Frank Gurski, Egon Wanke

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.031

zbMATH Keywords

clique-width; tree-width; leaf powers; NLC-width; tree powers; Steiner powers

Mathematics Subject Classification ID

05C38: Paths and cycles

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)