Paired-domination in generalized claw-free graphs

From MaRDI portal
Publication:2460102


DOI10.1007/s10878-006-9022-8zbMath1125.05072MaRDI QIDQ2460102

Paul Dorbec, Sylvain Gravier, Michael A. Henning

Publication date: 14 November 2007

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

Full work available at URL: https://doi.org/10.1007/s10878-006-9022-8


05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)


Related Items

My Favorite Domination Conjectures in Graph Theory Are Bounded, Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs, Locating-total domination in claw-free cubic graphs, On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\), Which trees have a differentiating-paired dominating set?, Paired-domination in subdivided star-free graphs, Graphs with disjoint dominating and paired-dominating sets, An upper bound on the paired-domination number in terms of the number of edges in the graph, Well paired-dominated graphs, A characterization of graphs with disjoint dominating and paired-dominating sets, Upper paired-domination in claw-free graphs, A characterization of cubic graphs with paired-domination number three-fifths their order, Labelling algorithms for paired-domination problems in block and interval graphs, Paired-domination in \(P_{5}\)-free graphs, Distance paired-domination problems on subclasses of chordal graphs, Total domination versus paired-domination in regular graphs, Paired-domination in claw-free graphs with minimum degree at least three, Vertices in all minimum paired-dominating sets of block graphs, Paired-domination number of claw-free odd-regular graphs, Paired versus double domination in \(K_{1,r}\)-free graphs, Graphs with maximum size and given paired-domination number, Paired-domination in claw-free graphs, The paired-domination and the upper paired-domination numbers of graphs



Cites Work