Nearly perfect sets in graphs

DOI10.1016/0012-365X(94)00205-WMaRDI QIDQ1842165zbMATH OpenFDO

Authors Jean E. Dunbar, F. Harris, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar

Publication date 17 April 1995

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

nearly perfect sets

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) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 2204177
• Nearly perfect sets in the \(n\)-fold products of graphs
• Proper nearly perfect sets in graphs.
• scientific article; zbMATH DE number 1208726
• scientific article; zbMATH DE number 6180527

Cites work

• scientific article; zbMATH DE number 3974289 (Why is no real title available?)
• scientific article; zbMATH DE number 4049086 (Why is no real title available?)
• scientific article; zbMATH DE number 4095510 (Why is no real title available?)
• scientific article; zbMATH DE number 22648 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 933213 (Why is no real title available?)
• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• Linear algorithms on recursive representations of trees
• On approximating the minimum independent dominating set
• On generalised minimal domination parameters for paths

Cited in

(14)

• Nearly perfect sets in the \(n\)-fold products of graphs
• Outer complete fair domination in graphs
• scientific article; zbMATH DE number 2204177 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• \((1, j)\)-set problem in graphs
• 1-Triangle graphs and perfect neighborhood sets
• A Taxonomy of Perfect Domination
• Equitable fair domination in graphs
• Proper nearly perfect sets in graphs.
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• \([1,2]\)-sets in graphs
• Immune sets in monotone infection rules. Characterization and complexity
• A note on matching-cut in \(P_t\)-free graphs
• My top 10 graph theory conjectures and open problems

This page was built for publication: Nearly perfect sets in graphs

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