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

zbMATH Open1413.05282MaRDI QIDQ2829059FDOQ2829059

Authors: Xinguo Cao, Erfang Shan 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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

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)

Cited In (8)

• Title not available (Why is that?)
• Paired-domination in claw-free cubic graphs
• Upper paired-domination in claw-free graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in claw-free graphs with minimum degree at least four.
• Paired versus double domination in \(K_{1,r}\)-free graphs
• Paired-domination in claw-free graphs
• Title not available (Why is that?)

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)