A proof of a conjecture on the differential of a subcubic graph
From MaRDI portal
Publication:2004071
Recommendations
Cites work
- Combinatorics for smaller kernels: the differential of a graph
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Differentials in graphs
- Lower bounds on the differential of a graph
- On the differential in graphs
- Roman domination in graphs
- Roman domination in graphs.
- The differential and the roman domination number of a graph
- The differential of the strong product graphs
- Varieties of Roman domination. II
Cited in
(2)
This page was built for publication: A proof of a conjecture on the differential of a subcubic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004071)