Paired-domination in claw-free graphs
From MaRDI portal
Publication:2637727
DOI10.1007/s00373-012-1224-5zbMath1298.05249MaRDI QIDQ2637727
Shenwei Huang, Erfang Shan, Li-ying Kang
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1224-5
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Paired-domination in claw-free graphs with minimum degree at least three, Paired-domination number of claw-free odd-regular graphs, Upper bounds for the paired-domination numbers of graphs, Paired Domination in Graphs
Cites Work
- Paired-domination in claw-free cubic graphs
- Upper paired-domination in claw-free graphs
- Graphs with large paired-domination number
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Labelling algorithms for paired-domination problems in block and interval graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Upper bounds on the paired-domination number
- Paired-domination of trees
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
- Paired-domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
