Minimal dominating sets in maximum domatic partitions

MaRDI QIDQ3166117zbMATHFDO

Authors S. Arumugam, K. Raja Chandrasekar

Publication date 21 October 2012

zbMATH Keywords

maximum domatic partitionsminimal dominating \(d\)-partition

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the \(b\)-domatic number of graphs
• scientific article; zbMATH DE number 6311742
• scientific article; zbMATH DE number 1161319
• scientific article; zbMATH DE number 1124606
• The domatic number problem

Cited in

(15)

• Domatically perfect graphs
• Graphs with minimum fractional domatic number
• scientific article; zbMATH DE number 5990006 (Why is no real title available?)
• Upper bound of embedding index in grid graphs
• Dominator partitions of graphs
• scientific article; zbMATH DE number 4014770 (Why is no real title available?)
• Maximum number of minimum dominating and minimum total dominating sets
• The \(b\)-domatic number of a graph
• The upper dominator partition number of some simple graphs
• Domatic partitions and the Lovász local lemma
• On the \(b\)-domatic number of graphs
• The minimal dominant set is a non-empty core-extension
• Embedding index in some classes of graphs
• Domatically full Cartesian product graphs
• On maximum number of minimal dominating sets in graphs

This page was built for publication: Minimal dominating sets in maximum domatic partitions

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