Open packing subdivision number of graphs
From MaRDI portal
Recommendations
Cites work
- Changing and unchanging open packing: edge removal
- Domination and independence subdivision numbers of graphs
- Domination subdivision numbers of trees
- Effect of edge-subdivision on vertex-domination in a graph
- Effect of open packing upon vertex removal
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 1934399 (Why is no real title available?)
- On open packing number of graphs
- On the 2-independence subdivision number of graphs
- Packing parameters in graphs
- Relations between packing and covering numbers of a tree
- Roman domination subdivision number of graphs
- Secure domination subdivision number of a graph
- Total Domination in Categorical Products of Graphs
- Total domination subdivision numbers of trees
Cited in
(8)- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- On open packing number of graphs
- Open packing number for some classes of perfect graphs
- Edge open packing sets in graphs
- Outer-connected open packing sets in graphs
- Open packing bondage number of a graph
- Open packing saturation number of a graph
- Unicyclic graphs with edge open packing number three
This page was built for publication: Open packing subdivision number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059103)
