Total matchings and total coverings of graphs

DOI10.1002/JGT.3190010209MaRDI QIDQ4154591zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• Graphs with forbidden subgraphs

Cited in

(22)

• On the complexity of variations of mixed domination on graphs
• On total covers of graphs
• Improved parameterized algorithms and kernels for mixed domination
• Upper and lower bounds on approximating weighted 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
• On total covering and matching of graphs
• scientific article; zbMATH DE number 7764100 (Why is no real title available?)
• Signed mixed Roman domination numbers in graphs
• Signed mixed dominating functions in complete bipartite graphs
• A note on independent vertex-edge domination in graphs
• Outer-paired domination in graphs
• Total coloring and total matching: polyhedra and facets
• 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
• Explicit construction of mixed dominating sets in generalized Petersen graphs
• Using maximality and minimality conditions to construct inequality chains
• 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)