Total matchings and total coverings of graphs
From MaRDI portal
Publication:4154591
DOI10.1002/JGT.3190010209zbMATH Open0376.05045OpenAlexW2062915396MaRDI QIDQ4154591FDOQ4154591
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
Cites Work
Cited In (22)
- On total covers of graphs
- Upper and lower bounds on approximating weighted mixed domination
- Improved parameterized algorithms and kernels for mixed domination
- Mixed domination and 2-independence in trees
- Total matchings and total coverings of threshold graphs
- Double total domination of graphs
- Totally equimatchable graphs
- The algorithmic complexity of mixed domination in graphs
- Title not available (Why is that?)
- On total covering and matching of graphs
- Signed mixed dominating functions in complete bipartite graphs
- Signed mixed Roman domination numbers in graphs
- Outer-paired domination in graphs
- A note on independent vertex-edge domination in graphs
- Total coloring and total matching: polyhedra and facets
- Explicit construction of mixed dominating sets in generalized Petersen graphs
- Mixed Roman domination in graphs
- On total matching numbers and total covering numbers of complementary graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Using maximality and minimality conditions to construct inequality chains
- On the complexity of variations of mixed domination on graphs†
- On the relations of graph parameters and its total parameters
This page was built for publication: Total matchings and total coverings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154591)
