Vertex partitioning problems on partial k-trees

DOI10.1007/3-540-61422-2_129zbMath0886.05106OpenAlexW1675884157MaRDI QIDQ4375643

T. Shermer, D. Kaller, Arvind Kumar Gupta, Sanjeev Mahajan

Publication date: 4 May 1998

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_129

zbMATH Keywords

monadic second-order logicpolynomial-time algorithmspartial \(k\)-treespattern graphco-dominating sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Vertex partitioning problems on partial k-trees