Pages that link to "Item:Q401302"
From MaRDI portal
The following pages link to Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302):
Displaying 13 items.
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Finding regular subgraphs in both arbitrary and planar graphs (Q1923612) (← links)
- Bounds for regular induced subgraphs of strongly regular graphs (Q2092379) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- Polynomial time algorithms for two classes of subgraph problem (Q3598037) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)