Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction

DOI10.1016/j.dam.2021.09.009zbMath1479.05263arXiv2010.14155OpenAlexW3202513543MaRDI QIDQ2235275

Bernard Ries, F. Mann, Esther Galby

Publication date: 21 October 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.14155

zbMATH Keywords

dominationedge contraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Using edge contractions and vertex deletions to reduce the independence number and the clique number ⋮ Reducing the vertex cover number via edge contractions ⋮ Reducing graph parameters by contractions and deletions ⋮ Using edge contractions to reduce the semitotal domination number

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction