Restrained domination in claw-free graphs with minimum degree at least two
From MaRDI portal
Publication:968212
DOI10.1007/S00373-010-0883-3zbMATH Open1205.05167OpenAlexW2031319443MaRDI QIDQ968212FDOQ968212
Authors: Johannes H. Hattingh, Ernst J. Joubert 
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0883-3
Recommendations
- Total restrained domination in claw-free graphs with minimum degree at least two
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- Restrained domination in graphs with minimum degree two
- Total restrained domination in claw-free graphs
- Restrained domination in cubic graphs
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with large restrained domination number
- Restrained domination in graphs
- Restrained domination in trees
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- On total restrained domination in graphs
- An upper bound on the total restrained domination number of a tree
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- A note on restrained domination in trees.
- Trees with equal domination and restrained domination numbers
- Restrained domination excellent trees.
Cited In (9)
- Total restrained domination in claw-free graphs with minimum degree at least two
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- Restrained domination in cubic graphs
- Total restrained domination in claw-free graphs
- Restrained and total restrained domination in graphs
- Title not available (Why is that?)
- Claw-free graphs with equal 2-domination and domination numbers
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
This page was built for publication: Restrained domination in claw-free graphs with minimum degree at least two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968212)
