scientific article; zbMATH DE number 436074

MaRDI QIDQ3139859zbMATH OpenFDO

Authors Johannes H. Hattingh, Michael A. Henning

Publication date 18 November 1993

zbMATH Keywords

NP-completeupper distance irredundance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• Distance irredundance in graphs: Complexity issues
• scientific article; zbMATH DE number 4055676
• scientific article; zbMATH DE number 861435
• scientific article; zbMATH DE number 238431
• On the product of upper irredundance numbers of a graph and its complement

Cited in

(5)

• Distance irredundance in graphs: Complexity issues
• Irredundance perfect graphs
• Maximal irredundant functions
• Irredundance in grids
• The complexity of irredundant sets parameterized by size

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 Q3139859)