Pages that link to "Item:Q1356566"

The following pages link to On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566):

Displaying 10 items.

• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Graph editing problems with extended regularity constraints (Q526874) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
• Finding regular subgraphs in both arbitrary and planar graphs (Q1923612) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)