Paired-domination in claw-free graphs with minimum degree at least four.

MaRDI QIDQ2829059zbMATHFDO

Authors Xinguo Cao, Erfang Shan

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

minimum degreeclaw-free graphpaired-domination

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

• Paired-domination in claw-free graphs with minimum degree at least four.
• Paired-domination in claw-free graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in subdivided star-free graphs
• Upper paired-domination in claw-free graphs

Cited in

(8)

• Paired versus double domination in \(K_{1,r}\)-free graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in claw-free cubic graphs
• scientific article; zbMATH DE number 5670545 (Why is no real title available?)
• Upper paired-domination in claw-free graphs
• scientific article; zbMATH DE number 2188616 (Why is no real title available?)
• Paired-domination in claw-free graphs with minimum degree at least four.
• Paired-domination in claw-free graphs

This page was built for publication: Paired-domination in claw-free graphs with minimum degree at least four.

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