On switching classes, NLC-width, cliquewidth and treewidth

DOI10.1016/j.tcs.2011.12.021zbMath1242.05217WikidataQ59567556 ScholiaQ59567556MaRDI QIDQ418754

Hans L. Bodlaender, Jurriaan Hage

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.021

zbMATH Keywords

graph decomposition

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs

05C12: Distance in graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)