Pages that link to "Item:Q1029004"

The following pages link to Some results on graphs without long induced paths (Q1029004):

Displaying 47 items.

• Augmenting approach for some maximum set problems (Q284765) (← links)
• Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
• Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
• 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• On sequential heuristic methods for the maximum independent set problem (Q521760) (← 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)
• Mind the independence gap (Q776261) (← links)
• The parameterized complexity of the induced matching problem (Q1028465) (← links)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• On the approximability of the maximum induced matching problem (Q1775017) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• New kernels for several problems on planar graphs (Q2285156) (← links)
• Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
• New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
• An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
• On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
• Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• Squares of Intersection Graphs and Induced Matchings (Q3439440) (← 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)
• New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• (Q5225203) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• (Q6078549) (← links)
• Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
• Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)