The following pages link to (Q4750685):
Displaying 10 items.
- Regular subgraphs of almost regular graphs (Q595688) (← links)
- Every 4-regular graph plus an edge contains a 3-regular subgraph (Q798336) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory (Q1087559) (← links)
- Indecomposable regular graphs and hypergraphs (Q1197014) (← links)
- Total \([1,2]\)-domination in graphs (Q1617038) (← links)
- Existence of 3-regular subgraphs in Cartesian product of cycles (Q2176167) (← links)
- Polynomial time algorithms for two classes of subgraph problem (Q3598037) (← links)
