Tree decomposition of graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W" /><237::AID-RSA2>3.0.CO;2-W 10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-WzbMath0917.05059OpenAlexW2026218370MaRDI QIDQ4240601

Raphael Yuster

Publication date: 29 April 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199805)12:3<237::aid-rsa2>3.0.co;2-w

zbMATH Keywords

treedecomposition

Mathematics Subject Classification ID

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

Related Items (3)

Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Packing and decomposition of graphs with trees ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles

This page was built for publication: Tree decomposition of graphs