scientific article; zbMATH DE number 3549014

MaRDI QIDQ4123349zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi, S. Goodman

Publication date 1975

Mathematics Subject Classification ID

Trees (05C05) Algorithms in computer science (68W99)

Cited in

(8)

• Cores of simplicial complexes
• Bibliography on domination in graphs and some basic definitions of domination parameters
• On the computational complexity of upper fractional domination
• The private neighbor concept
• Linear algorithms on recursive representations of trees
• Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time

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