Pages that link to "Item:Q1336698"
From MaRDI portal
The following pages link to Regular codes in regular graphs are difficult (Q1336698):
Displayed 9 items.
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- 1-perfect codes in Sierpiński graphs (Q4806494) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)