Proper nearly perfect sets in graphs.

MaRDI QIDQ2828987zbMATH OpenFDO

Authors Changiz Eslahchi, H. R. Maimani, Reza Torabi, R. Tusserkani

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

diameterdominationgirthnearly perfect set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Nearly perfect sets in graphs
• Complete partitions of graphs
• scientific article; zbMATH DE number 2204177
• Nearly perfect sets in the \(n\)-fold products of graphs
• The path partition problem and related problems in bipartite graphs

Cited in

(4)

• Nearly perfect sets in graphs
• Nearly perfect sets in the \(n\)-fold products of graphs
• scientific article; zbMATH DE number 2204177 (Why is no real title available?)
• Immune sets in monotone infection rules. Characterization and complexity

This page was built for publication: Proper nearly perfect sets in graphs.

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