A note on domination and independence-domination numbers of graphs

DOI10.26493/1855-3974.282.71CzbMATH Open1301.05253OpenAlexW1813734797WikidataQ129355341 ScholiaQ129355341MaRDI QIDQ2925428

Martin Milanič

Publication date: 22 October 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.282.71c

zbMATH Keywords

NP-completenessVizing's conjecturedomination numberhereditary graph classweakly chordal graphIDD-perfect graphindependence-domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (5)

Note on the domination unmber of a graph ⋮ A note on the domination number of a graph and its complement ⋮ A note on graphs contraction-critical with respect to independence number ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ A note on cops and robbers, independence number, domination number and diameter

This page was built for publication: A note on domination and independence-domination numbers of graphs

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