Pages that link to "Item:Q400496"
From MaRDI portal
The following pages link to A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496):
Displaying 10 items.
- On domination number and distance in graphs (Q906450) (← links)
- Total domination versus domination in cubic graphs (Q1706439) (← links)
- Coupon-coloring and total domination in Hamiltonian planar triangulations (Q1756106) (← links)
- On upper total domination versus upper domination in graphs (Q2000568) (← links)
- A note on the triameter of graphs (Q2065800) (← links)
- Triameter of graphs (Q2227115) (← links)
- A classification of cactus graphs according to their total domination number (Q2305640) (← links)
- Bounds on the sum of domination number and metric dimension of graphs (Q4554552) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- A new lower bound on the total domination number of a graph (Q5880783) (← links)
