scientific article; zbMATH DE number 238431

zbMATH Open0777.05072MaRDI QIDQ5287870FDOQ5287870

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

Publication date: 5 August 1993

Title of this publication is not available (Why is that?)

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

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)

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
• Title not available (Why is that?)
• Distance domination in graphs
• Approximations of the domination number of a graph
• Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.
• Title not available (Why is that?)

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)