Total matchings and total coverings of graphs
From MaRDI portal
Publication:4154591
DOI10.1002/jgt.3190010209zbMath0376.05045OpenAlexW2062915396MaRDI QIDQ4154591
Yousef Alavi, Mehdi Behzad, Linda Lesniak, E. A. Nordhaus
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010209
Related Items (21)
Total matchings and total coverings of threshold graphs ⋮ Mixed domination and 2-independence in trees ⋮ Totally equimatchable graphs ⋮ Double total domination of graphs ⋮ Signed mixed Roman domination numbers in graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Total coloring and total matching: polyhedra and facets ⋮ Mixed Roman domination in graphs ⋮ On the complexity of variations of mixed domination on graphs† ⋮ Unnamed Item ⋮ A note on independent vertex-edge domination in graphs ⋮ On total covers of graphs ⋮ The algorithmic complexity of mixed domination in graphs ⋮ On the relations of graph parameters and its total parameters ⋮ On total matching numbers and total covering numbers of complementary graphs ⋮ On total covering and matching of graphs ⋮ Upper and lower bounds on approximating weighted mixed domination ⋮ Improved parameterized algorithms and kernels for mixed domination ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Outer-paired domination in graphs ⋮ Signed mixed dominating functions in complete bipartite graphs
Cites Work
This page was built for publication: Total matchings and total coverings of graphs
