On some simple widths

DOI10.1007/978-3-642-11440-3_19zbMATH Open1274.05380OpenAlexW1598989106MaRDI QIDQ3404447FDOQ3404447

Authors: Ling-Ju Hung, Ton Kloks 

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_19

Recommendations

• Block-Graph Width
• Trivially-perfect width
• Block-graph width
• The pathwidth and treewidth of cographs
• The Pathwidth and Treewidth of Cographs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Block-graph width
• Block-Graph Width
• On the width of hybrid zones
• An adjacency labeling scheme based on a decomposition of trees into caterpillars
• Trivially-perfect width
• 2-widths of the Hölder unit balls

This page was built for publication: On some simple widths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404447)