The Rank-Width of the Square Grid

DOI10.1007/978-3-540-92248-3_21zbMath1202.05107OpenAlexW2178035068MaRDI QIDQ5302058

Vít Jelínek

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_21

zbMATH Keywords

grid graphrank-width

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Graph classes with structured neighborhoods and algorithmic applications ⋮ Boolean-width of graphs ⋮ Boolean-Width of Graphs

Cites Work

• Approximating clique-width and branch-width
• Rank‐width is less than or equal to branch‐width
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: The Rank-Width of the Square Grid