scientific article; zbMATH DE number 238431

MaRDI QIDQ5287870zbMATH OpenFDO

Authors Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters

Publication date 5 August 1993

zbMATH Keywords

computational complexitydistance dominationfractional domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (05C99)

Recommendations

• On the computational complexity of upper fractional domination
• On the computational complexity of upper total domination
• scientific article; zbMATH DE number 731842
• scientific article; zbMATH DE number 844146
• Publication:4734763

Cited in

(8)

• On the computational complexity of upper total domination
• On the computational complexity of upper fractional domination
• Linear programming approach for various domination parameters
• scientific article; zbMATH DE number 436074 (Why is no real title available?)
• Distance domination in graphs
• Approximations of the domination number of a graph
• Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.
• scientific article; zbMATH DE number 4121429 (Why is no real title available?)

This page was built for publication:

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