Matchings, path covers and domination
From MaRDI portal
Publication:329554
DOI10.1016/J.DISC.2016.07.020zbMATH Open1347.05157OpenAlexW2511530215MaRDI QIDQ329554FDOQ329554
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Some remarks on domination
- Total Domination in Graphs
- A survey of selected recent results on total domination in graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On matching and total domination in graphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- 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
- 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
- Title not available (Why is that?)
- Some results on matching and total domination in graphs
- Title not available (Why is that?)
- Matching properties in total domination vertex critical graphs
Cited In (4)
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)
