Pages that link to "Item:Q5904287"
From MaRDI portal
The following pages link to Three‐regular subgraphs of four‐regular graphs (Q5904287):
Displaying 12 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)
- Regular subgraphs of almost regular graphs (Q595688) (← links)
- Three-regular parts of four-regular graphs (Q762503) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Polynomial time algorithms for two classes of subgraph problem (Q3598037) (← links)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs (Q5264756) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)
