Pages that link to "Item:Q2465640"

The following pages link to NP-hard graph problems and boundary classes of graphs (Q2465640):

Displaying 48 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)
• Two complexity results for the vertex coloring problem (Q505438) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• Critical hereditary graph classes: a survey (Q518125) (← links)
• Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
• Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
• On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← 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)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• New potential functions for greedy independence and coloring (Q2255044) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← 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)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Boundary properties of the satisfiability problems (Q2450928) (← links)
• A Boundary Property for Upper Domination (Q2819507) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• max-cut and Containment Relations in Graphs (Q3057609) (← links)
• Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
• Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
• (Q5225203) (← links)
• Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
• Computing coverage kernels under restricted settings (Q5919535) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• (Q6054225) (← links)
• The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)
• Critical properties of bipartite permutation graphs (Q6142657) (← links)
• Maximum dissociation sets in subcubic trees (Q6176408) (← links)
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
• Extremal vertex-degree function index with given order and dissociation number (Q6184319) (← links)
• On spectral extrema of graphs with given order and dissociation number (Q6184344) (← links)
• On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
• The maximum number of maximum generalized 4-independent sets in trees (Q6606325) (← links)
• On the \(A_\alpha\)-index of graphs with given order and dissociation number (Q6648258) (← links)