Some structures of 3-(_c, 2)-critical graphs which are not 3-_c-critical

MaRDI QIDQ2811688zbMATH OpenFDO

Authors S. Mamart, N. Ananchuen

Publication date 10 June 2016

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

connected dominationedge-critical

Mathematics Subject Classification ID

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

Recommendations

• A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
• A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
• On the 3-_t-critical graphs of order (G)+3
• Characteristics of (,3)-critical graphs
• A note on 3-_t-critical k-regular graphs
• A characterization of 3-i-critical graphs of connectivity two
• On connected 3-\(\gamma_L\)-dot-critical graphs
• On critical 3-connected graphs with two vertices of degree 3. II
• scientific article; zbMATH DE number 861424
• On critical 3-connected graphs with two vertices of degree 3. I

Cited in

(9)

• Some results on the independence number of connected domination critical graphs
• Connected domination critical graphs.
• A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
• Codiameters of 3-connected 3-domination critical graphs
• The diameter of connected domination critical graphs.
• The spectrum of dihedral quadruoke systems
• On the structure of graphs vertex critical with~respect to connected domination
• On local edge connected domination critical graphs
• A note on connected domination critical graphs

This page was built for publication: Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical

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