scientific article; zbMATH DE number 1760766

zbMath0992.05056MaRDI QIDQ4537256

Feng Tian, Bing Wei, Yaojun Chen

Publication date: 30 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

toughnessdomination critical graphconnectivity number\(3\)-critical graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) ⋮ Some results related to the toughness of 3-domination critical graphs ⋮ Matching properties in domination critical graphs. ⋮ 3-factor-criticality in domination critical graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Properties of total domination edge-critical graphs ⋮ Codiameters of 3-domination critical graphs with toughness more than one ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)

This page was built for publication: