Paired-domination in generalized claw-free graphs
From MaRDI portal
Publication:2460102
DOI10.1007/S10878-006-9022-8zbMATH Open1125.05072OpenAlexW2129851766MaRDI QIDQ2460102FDOQ2460102
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 trees
- Trees with large paired-domination number
- Title not available (Why is that?)
- Total and paired-domination numbers of a tree
- Paired-domination
- 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
Cited In (28)
- Even pairs in claw-free perfect graphs
- Graphs with maximum size and given paired-domination number
- Which trees have a differentiating-paired dominating set?
- Generalized power domination in claw-free regular graphs
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Well paired-dominated graphs
- Upper paired-domination in claw-free graphs
- Paired-domination in subdivided star-free graphs
- Graphs with disjoint dominating and paired-dominating sets
- Locating-total domination in claw-free cubic graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Paired-domination number of claw-free odd-regular graphs
- Paired-domination in \(P_{5}\)-free graphs
- Upper paired domination versus upper domination
- Vertices in all minimum paired-dominating sets of block graphs
- Distance paired-domination problems on subclasses of chordal graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
- Paired versus double domination in \(K_{1,r}\)-free graphs
- My Favorite Domination Conjectures in Graph Theory Are Bounded
- Claw-free graphs with equal 2-domination and domination numbers
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Paired-domination in claw-free graphs
- The paired-domination and the upper paired-domination numbers of graphs
- Total domination versus paired-domination in regular graphs
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Paired Domination in Graphs
This page was built for publication: Paired-domination in generalized claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460102)
