Pages that link to "Item:Q2275943"

The following pages link to The complexity of dissociation set problems in graphs (Q2275943):

Displaying 41 items.

• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• Relating dissociation, independence, and matchings (Q2081478) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
• Uniformly dissociated graphs (Q4604516) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5225203) (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• A bound on the dissociation number (Q6047956) (← links)
• The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
• Relating the independence number and the dissociation number (Q6094030) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← 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)
• Minimum number of maximal dissociation sets in trees (Q6193972) (← links)
• On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
• Enumerating maximal dissociation sets in three classes of grid graphs (Q6585552) (← 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)