Generalized independence and domination in graphs
From MaRDI portal
(Redirected from Publication:1584435)
Recommendations
Cites work
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- Bounds on a generalized domination parameter
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Two Bounds for the Domination Number of a Graph
Cited in
(6)- Independence-domination duality
- Independence and graph homomorphisms graph homomorphisms
- Independent partial domination
- Atom probe tomography characterization of solute segregation to dislocations and interfaces
- Independent sets in graphs
- Data reductions and combinatorial bounds for improved approximation algorithms
This page was built for publication: Generalized independence and domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584435)