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):

Displaying 50 items.

• A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
• The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
• A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
• Structure of squares and efficient domination in graph classes (Q338382) (← links)
• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
• Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• The coloring problem for classes with two small obstructions (Q479257) (← links)
• A new graph construction of unbounded clique-width (Q509276) (← links)
• Critical hereditary graph classes: a survey (Q518125) (← links)
• Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
• On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
• Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← 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)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
• A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
• Boundary classes of graphs for the dominating set problem (Q1877644) (← links)
• Role colouring graphs in hereditary classes (Q2034782) (← links)
• Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
• Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
• Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
• Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
• Tree-width dichotomy (Q2136198) (← links)
• New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• From matchings to independent sets (Q2403787) (← links)
• Boundary graph classes for some maximum induced subgraph problems (Q2444152) (← 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)
• A Boundary Property for Upper Domination (Q2819507) (← links)
• Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
• max-cut and Containment Relations in Graphs (Q3057609) (← links)
• On the number of boundary classes in the 3-colouring problem (Q3225901) (← links)
• Boundary Classes of Planar Graphs (Q3512606) (← links)
• Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
• Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
• Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002) (← links)
• On König graphs with respect to P4 (Q5374003) (← links)