Matchings, path covers and domination
From MaRDI portal
Publication:329554
DOI10.1016/j.disc.2016.07.020zbMath1347.05157OpenAlexW2511530215MaRDI QIDQ329554
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Nontrivial path covers of graphs: existence, minimization and maximization ⋮ Matching, path covers, and total forcing sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings and transversals in hypergraphs, domination and independence in trees
- Matching properties in total domination vertex critical graphs
- A survey of selected recent results on total domination in graphs
- Total domination and matching numbers in graphs with all vertices in triangles
- Trees with large neighborhood total domination number
- Bounds on neighborhood total domination in graphs
- On matching and total domination in graphs
- Total domination and matching numbers in claw-free graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Neighbourhood total domination in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Hypergraphs with large transversal number and with edge sizes at least 3
- Some remarks on domination
- Some results on matching and total domination in graphs
- Total Domination in Graphs
This page was built for publication: Matchings, path covers and domination
