Paired-domination in claw-free cubic graphs
From MaRDI portal
Publication:704853
DOI10.1007/S00373-004-0577-9zbMATH Open1054.05074OpenAlexW2074992283MaRDI QIDQ704853FDOQ704853
Authors: Odile Favaron, Michael A. Henning 
Publication date: 20 January 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-004-0577-9
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (45)
- My favorite domination conjectures in graph theory are bounded
- Disjunctive total domination in graphs
- Graphs with maximum size and given paired-domination number
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Upper bounds for the paired-domination numbers of graphs
- Disjoint paired-dominating sets in cubic graphs
- Which trees have a differentiating-paired dominating set?
- On a conjecture on total domination in claw-free cubic graphs
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- A characterization of graphs with semitotal domination number one-third their order
- Bounds on total domination in claw-free cubic graphs
- A survey of selected recent results on total domination in graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Upper paired-domination in claw-free graphs
- Paired-domination in subdivided star-free graphs
- Paired-domination in generalized claw-free graphs
- Graphs with disjoint dominating and paired-dominating sets
- Locating-total domination in claw-free cubic graphs
- Total restrained domination in cubic graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Paired-domination number of claw-free odd-regular graphs
- Paired-domination in \(P_{5}\)-free graphs
- Upper paired domination versus upper domination
- Semitotal domination in claw-free cubic graphs
- Vertices in all minimum paired-dominating sets of block graphs
- Paired domination in graphs
- 2-distance paired-dominating number of graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Paired-domination subdivision numbers of graphs
- Graphs with large paired-domination number
- On matching and total domination in graphs
- Domination versus total domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Upper bounds on the paired-domination number
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Paired bondage in trees
- Total forcing and zero forcing in claw-free cubic graphs
- Paired-domination in claw-free graphs
- The paired-domination and the upper paired-domination numbers of graphs
- Triangles and (total) domination in subcubic graphs
- Total domination versus paired-domination in regular graphs
- Semipaired domination in claw-free cubic graphs
- A characterization of cubic graphs with paired-domination number three-fifths their order
- The diameter of paired-domination vertex critical graphs
- Cubic graphs have paired-domination number at most four-seventh of their orders
This page was built for publication: Paired-domination in claw-free cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704853)
