Upper paired-domination in claw-free graphs

DOI10.1007/s10878-009-9275-0zbMath1250.90099OpenAlexW2010823229MaRDI QIDQ719019

Michael A. Henning, Paul Dorbec

Publication date: 27 September 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9275-0

zbMATH Keywords

minimum degreeclaw-free graphsupper paired-domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (7)

Upper bounds for the paired-domination numbers of graphs ⋮ Paired-domination in claw-free graphs ⋮ Unnamed Item ⋮ Paired-domination in claw-free graphs with minimum degree at least three ⋮ Algorithmic aspects of upper paired-domination in graphs ⋮ Paired Domination in Graphs ⋮ Upper paired domination versus upper domination

Cites Work

• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Claw-free graphs---a survey
• Total and paired-domination numbers of a tree
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination
• Paired-domination in graphs
• Upper total domination versus upper paired-domination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper paired-domination in claw-free graphs