Independent domination and matchings in graphs

DOI10.1016/S0012-365X(02)00304-7zbMath1015.05064OpenAlexW2084029063MaRDI QIDQ1861228

Lutz Volkmann, Dieter Rautenbach

Publication date: 16 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00304-7

zbMATH Keywords

matchingindependent domination2-satisfiability

Mathematics Subject Classification ID

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 (4)

A note on connected bipartite graphs having independent domination number half their order. ⋮ Well-covered graphs and factors ⋮ On average lower independence and domination numbers in graphs ⋮ Independent Domination in Triangle Graphs

This page was built for publication: Independent domination and matchings in graphs