Generalized independence and domination in graphs

DOI10.1016/S0012-365X(98)00092-2zbMath0958.05102OpenAlexW2072286302MaRDI QIDQ1584435

Mieczysław Borowiecki, Danuta Michalak

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00092-2

zbMATH Keywords

dominationvertex partitionindependent subsets\({\mathcal P}\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Independent sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Bounds on a generalized domination parameter
• Two Bounds for the Domination Number of a Graph

This page was built for publication: Generalized independence and domination in graphs