Pages that link to "Item:Q1877644"

The following pages link to Boundary classes of graphs for the dominating set problem (Q1877644):

Displaying 27 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)
• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
• A decidability result for the dominating set problem (Q410736) (← links)
• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• The coloring problem for classes with two small obstructions (Q479257) (← 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)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• Boundary graph classes for some maximum induced subgraph problems (Q2444152) (← links)
• NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
• A Boundary Property for Upper Domination (Q2819507) (← links)
• max-cut and Containment Relations in Graphs (Q3057609) (← links)
• On the number of boundary classes in the 3-colouring problem (Q3225901) (← links)
• Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• (Q6054225) (← links)
• Critical properties of bipartite permutation graphs (Q6142657) (← links)