Pages that link to "Item:Q2011113"
From MaRDI portal
The following pages link to Total forcing versus total domination in cubic graphs (Q2011113):
Displaying 7 items.
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- On the semitotal forcing number of a graph (Q2134991) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- The forcing nonsplit domination number of a graph (Q5006062) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
