Pages that link to "Item:Q2583122"

The following pages link to Independent packings in structured graphs (Q2583122):

Displaying 40 items.

• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• Induced graph packing problems (Q604669) (← links)
• On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
• Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
• Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
• Brambles and independent packings in chordal graphs (Q1045070) (← links)
• Packing triangles in bounded degree graphs. (Q1853132) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
• Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
• Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← 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)
• Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
• (Q5225203) (← links)
• The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• The maximum number of maximum dissociation sets in trees (Q6055404) (← 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)
• 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)