Matchings, path covers and domination

DOI10.1016/J.DISC.2016.07.020MaRDI QIDQ329554zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Kirsti Wash

Publication date 21 October 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.07.020

zbMATH Keywords

matchingpath covertotal dominationneighborhood total domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On total domination and minimum maximal matchings in graphs
• Some results on matching and total domination in graphs
• On matching and total domination in graphs
• A new upper bound on the total domination number of a graph
• On matching and semitotal domination in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 863471 (Why is no real title available?)
• scientific article; zbMATH DE number 5237312 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Bounds on neighborhood total domination in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Hypergraphs with large transversal number and with edge sizes at least 3
• Matching properties in total domination vertex critical graphs
• Matchings and transversals in hypergraphs, domination and independence in trees
• Neighbourhood total domination in graphs
• On matching and total domination in graphs
• Some remarks on domination
• Some results on matching and total domination in graphs
• Total domination and matching numbers in claw-free graphs
• Total domination and matching numbers in graphs with all vertices in triangles
• Total domination in graphs
• Trees with large neighborhood total domination number

Cited in

(4)

• Ramsey numbers of path-matchings, covering designs, and 1-cores
• Path coverings of graphs and height characteristics of matrices
• Nontrivial path covers of graphs: existence, minimization and maximization
• Matching, path covers, and total forcing sets

This page was built for publication: Matchings, path covers and domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329554)