Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
type: Item
instance of: scholarly article
title: Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
zbMATH Open document ID: 1189.05146
author: Erfang Shan
author: Haichao Wang
publication date: 2010-06-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5727642
zbMATH Keywords: matching
zbMATH Keywords: bicritical
zbMATH Keywords: double domination edge critical graphs
zbMATH Keywords: claw-free
MaRDI profile type: Publication
full work available at URL: j.camwa.2009.10.024
OpenAlex ID: W2063019779
cites work: Q4552196
cites work: Q3413515
cites work: Characterizations of trees with equal paired and double domination numbers
cites work: Q5461697
cites work: A note on Nordhaus-Gaddum inequalities for domination.
cites work: Q5422499
cites work: Extending matchings in claw-free graphs
cites work: On \(k\)-factor-critical graphs
DOI: 10.1016/J.CAMWA.2009.10.024
published in: Computers & Mathematics with Applications
Recommended article: Matchings in \(4\)-total restrained domination vertex critical graphs.
Recommended article: On \(4\)-\(\gamma_t\)-critical graphs of diameter two
Recommended article: On 4-\gamma_t-critical graphs of order 4+\Delta(G)
Recommended article: Q3004156
Recommended article: Matching properties in total domination vertex critical graphs
Recommended article: Matching properties in connected domination critical graphs
Recommended article: The structure of \(4-\gamma \)-critical graphs with a cut vertex
Recommended article: Q3655092
Recommended article: The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
Recommended article: Q5755104
description: scientific article; zbMATH DE number 5727642