Upper paired-domination in claw-free graphs
From MaRDI portal
Publication:719019
DOI10.1007/S10878-009-9275-0zbMATH Open1250.90099OpenAlexW2010823229MaRDI QIDQ719019FDOQ719019
Authors: Paul Dorbec, Michael A. Henning 
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
Recommendations
- Upper total domination in claw‐free graphs
- Paired-domination in claw-free graphs
- Paired-domination in generalized claw-free graphs
- Paired-domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- scientific article; zbMATH DE number 2222000
- Publication:4489223
- Upper minus domination in a claw-free cubic graph
- Paired-domination in claw-free graphs with minimum degree at least four.
Cites Work
- Claw-free graphs---a survey
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination of Cartesian products of graphs
- Paired-domination of trees
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Trees with large paired-domination number
- Title not available (Why is that?)
- Total and paired-domination numbers of a tree
- Graphs with large paired-domination number
- Lower bound on the paired domination number of a tree
- Paired-domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Diameter of paired domination edge-critical graphs
- Upper total domination versus upper paired-domination
Cited In (12)
- Title not available (Why is that?)
- Upper bounds for the paired-domination numbers of graphs
- Title not available (Why is that?)
- Algorithmic aspects of upper paired-domination in graphs
- Paired-domination in generalized claw-free graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Upper paired domination versus upper domination
- Dominating sets, packings, and the maximum degree
- Title not available (Why is that?)
- Paired-domination in claw-free graphs
- Upper total domination in claw‐free graphs
- Paired Domination in Graphs
This page was built for publication: Upper paired-domination in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719019)
