scientific article; zbMATH DE number 3807663
From MaRDI portal
Publication:4750685
Cited in
(10)- Two-regular subgraphs of hypergraphs
- A note on the complexity of finding regular subgraphs
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Indecomposable regular graphs and hypergraphs
- Total \([1,2]\)-domination in graphs
- Existence of 3-regular subgraphs in Cartesian product of cycles
- Polynomial time algorithms for two classes of subgraph problem
- Regular subgraphs of almost regular graphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- The complexity of regular subgraph recognition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4750685)