The total detection numbers of graphs
From MaRDI portal
Publication:2906262
Recommendations
Cited in
(6)- Parameterized and approximation complexity of the detection pair problem in graphs
- Detecting and Counting Small Pattern Graphs
- On the total detection numbers of complete bipartite graphs
- On detectable colorings of graphs
- A note on the total detection numbers of cycles
- Detection number of bipartite graphs and cubic graphs
This page was built for publication: The total detection numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906262)