Restrained domination in claw-free graphs with minimum degree at least two
type: Item
instance of: scholarly article
title: Restrained domination in claw-free graphs with minimum degree at least two
zbMATH Open document ID: 1205.05167
author: Johannes H. Hattingh
author: Ernst J. Joubert
published in: Graphs and Combinatorics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5703785
zbMATH Keywords: graph
zbMATH Keywords: domination
zbMATH Keywords: restrained domination
zbMATH Keywords: order of a graph
zbMATH Keywords: claw-free graph
zbMATH Keywords: upper bound
MaRDI profile type: Publication
full work available at URL: s00373-010-0883-3
OpenAlex ID: W2031319443
cites work: On total restrained domination in graphs
cites work: On equality in an upper bound for the restrained and total domination numbers of a graph
cites work: Trees with equal domination and restrained domination numbers
cites work: Restrained domination in trees
cites work: Restrained domination in graphs
cites work: Restrained domination in graphs with minimum degree two
cites work: Q3070295
cites work: An upper bound on the total restrained domination number of a tree
cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
cites work: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
cites work: Q3094567
cites work: Q4368728
cites work: Q4368729
cites work: Graphs with large restrained domination number
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
DOI: 10.1007/S00373-010-0883-3
description: scientific article; zbMATH DE number 5703785