Pages that link to "Item:Q4154591"
From MaRDI portal
The following pages link to Total matchings and total coverings of graphs (Q4154591):
Displaying 22 items.
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- On the relations of graph parameters and its total parameters (Q993698) (← links)
- On total covers of graphs (Q1198645) (← links)
- On total matching numbers and total covering numbers of complementary graphs (Q1245240) (← links)
- On total covering and matching of graphs (Q1247440) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Total matchings and total coverings of threshold graphs (Q1327237) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- Double total domination of graphs (Q1356756) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- A note on independent vertex-edge domination in graphs (Q1751226) (← links)
- Mixed domination and 2-independence in trees (Q2132130) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- Signed mixed dominating functions in complete bipartite graphs (Q5259070) (← links)
- Outer-paired domination in graphs (Q5859480) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- (Q6089653) (← links)
- Explicit construction of mixed dominating sets in generalized Petersen graphs (Q6646750) (← links)
