scientific article

zbMath0729.05047MaRDI QIDQ3353058

Dmitry V. Korobitsyn

Publication date: 1990

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

zbMATH Keywords

dominating setNP-completeforbidden subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (12)

Satgraphs and independent domination. I ⋮ Independent domination in hereditary classes ⋮ Boundary classes of graphs for the dominating set problem ⋮ Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time ⋮ Unnamed Item ⋮ A decidability result for the dominating set problem ⋮ On easy and hard hereditary classes of graphs with respect to the independent set problem ⋮ Solving problems on graphs of high rank-width ⋮ Unnamed Item ⋮ NP-hard graph problems and boundary classes of graphs ⋮ Upper domination: towards a dichotomy through boundary properties ⋮ A Boundary Property for Upper Domination

This page was built for publication: