Pages that link to "Item:Q1414579"

The following pages link to On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579):

Displayed 11 items.

• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) ‎ (← links)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) ‎ (← links)
• Some results on graphs without long induced paths (Q1029004) ‎ (← links)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) ‎ (← links)
• Boundary classes of graphs for the dominating set problem (Q1877644) ‎ (← links)
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) ‎ (← links)
• Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) ‎ (← links)
• NP-hard graph problems and boundary classes of graphs (Q2465640) ‎ (← links)
• On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) ‎ (← links)
• Augmenting chains in graphs without a skew star. (Q2490836) ‎ (← links)
• Boundary Classes of Planar Graphs (Q3512606) ‎ (← links)