Nearly perfect sets in graphs

DOI10.1016/0012-365X(94)00205-WzbMath0816.68092MaRDI QIDQ1842165

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

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) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items (9)

\((1, j)\)-set problem in graphs ⋮ A Taxonomy of Perfect Domination ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ \([1,2\)-sets in graphs] ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ A note on matching-cut in \(P_t\)-free graphs ⋮ Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs ⋮ Outer complete fair domination in graphs ⋮ Equitable fair domination in graphs

Cites Work

• On approximating the minimum independent dominating set
• On generalised minimal domination parameters for paths
• Linear algorithms on recursive representations of trees
• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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