Star-factors andk-bounded total domination

DOI10.1002/(SICI)1097-0037(199605)27:3%3C197::AID-NET4%3E3.0.CO;2-DMaRDI QIDQ4887750zbMATH OpenOpenAlexFDO

Authors Georg Gunther, Douglas F. Rall, Bert L. Hartnell

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199605)27:3%3C197::aid-net4%3E3.0.co;2-d

zbMATH Keywords

dominationstar-factor\(q\)-factor

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• A note on graphs with largest total k-domination number.
• Bounds on the l-total k-domatic number of a graph
• Bounds on the upper k-domination number and the upper k-star-forming number of a graph
• k-tuple total domatic number of a graph
• Total \([1,2]\)-domination in graphs

Cited in

(4)

• On barrier sets of star-factors
• On star polynomials of digraphs and their applications to domination
• Some results about star-factors in graphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Star-factors andk-bounded total domination

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