Factor domination and minimum degree

DOI10.1016/S0012-365X(02)00522-8MaRDI QIDQ1868841zbMATH OpenOpenAlexFDO

Authors Peter Dankelmann, Renu C. Laskar

Publication date 28 April 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00522-8

zbMATH Keywords

dominationfactor

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

• Factor domination in graphs
• scientific article; zbMATH DE number 140127
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Some nordhaus‐‐ gaddum‐type results
• Publication:4489228

Cited in

(6)

• Simultaneous graph parameters: factor domination and factor total domination
• Global domination
• Linear programming formulation for some generalized domination parameters
• On global domination critical graphs
• Simultaneous domination in graphs
• Minimum degree, independence number and regular factors

This page was built for publication: Factor domination and minimum degree

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