scientific article; zbMATH DE number 1760766

zbMATH Open0992.05056MaRDI QIDQ4537256FDOQ4537256

Authors: Yaojun Chen, Feng Tian, Bing Wei 

Publication date: 30 August 2002

Title of this publication is not available (Why is that?)

Recommendations

• Some results related to the toughness of 3-domination critical graphs
• Independence and connectivity in 3-domination-critical graphs
• Codiameters of 3-domination critical graphs with toughness more than one
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
• Some results on 3-domination critical graphs

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)

Cited In (10)

• Codiameters of 3-domination critical graphs with toughness more than one
• 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.
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
• \((3, k)\)-factor-critical graphs and toughness
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
• 3-factor-criticality in domination critical graphs
• Some results on 3-domination critical graphs
• Properties of total domination edge-critical graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537256)