Pages that link to "Item:Q5311918"
From MaRDI portal
The following pages link to A linear Vizing‐like relation relating the size and total domination number of a graph (Q5311918):
Displaying 10 items.
- A short proof of a result on a Vizing-like problem for integer total domination (Q604746) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph” (Q3437008) (← links)
- Relationships between total domination, order, size, and maximum degree of graphs (Q3594954) (← links)
- A linear vizing-like relation between the size and the domination number of a graph (Q4261185) (← links)
- Optimal linear‐Vizing relationships for (total) domination in graphs (Q6201029) (← links)