scientific article; zbMATH DE number 1262783

zbMath0929.90084MaRDI QIDQ4232773

Udi Rotics, Johann A. Makowsky

Publication date: 13 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphs of clique-width

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (13)

Parameterized power domination complexity ⋮ Target Set Selection in Dense Graph Classes ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques ⋮ On variations of \(P_{4}\)-sparse graphs ⋮ Clique-width of partner-limited graphs ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ GETGRATS ⋮ The complexity of frugal colouring ⋮ The monadic second-order logic of graphs. XII: Planar graphs and planar maps ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Conjunctive-query containment and constraint satisfaction ⋮ On -sparse graphs and other families

This page was built for publication: