Pages that link to "Item:Q1887072"

From MaRDI portal

← The weighted independent domination problem is NP-complete for chordal graphs (Q1887072)

Jump to:navigation, search

The following pages link to The weighted independent domination problem is NP-complete for chordal graphs (Q1887072):

Displayed 2 items.

Counting the number of independent sets in chordal graphs (Q935840) ‎ (← links)
On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) ‎ (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"