Pages that link to "Item:Q912615"

The following pages link to The complexity of regular subgraph recognition (Q912615):

Displaying 19 items.

• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Graph editing problems with extended regularity constraints (Q526874) (← links)
• A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
• Spectrally degenerate graphs: hereditary case (Q713975) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• On the complexity of some subgraph problems (Q967414) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Addendum to: The complexity of regular subgraph recognition (Q1175798) (← links)
• Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
• Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
• Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
• On the structure of trapezoid graphs (Q1917308) (← links)
• On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
• Construction of k-matchings in graph products (Q5058206) (← links)
• Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)