Constructing connected bicritical graphs with edge-connectivity 2

DOI10.1016/J.DAM.2011.03.012zbMATH Open1239.05136OpenAlexW1971677855MaRDI QIDQ412347FDOQ412347

Moo Young Sohn, Michitaka Furuya, Xuegang Chen, Shinya Fujita

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.012

zbMATH Keywords

domination numberdomination bicritical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Critical concepts in domination
• Bicritical domination
• Vertex domination-critical graphs
• The diameter of domination k‐critical graphs
• Domination critical graphs
• Title not available (Why is that?)

Cited In (3)

• Certified domination
• Title not available (Why is that?)
• Convex dominating sets in maximal outerplanar graphs

This page was built for publication: Constructing connected bicritical graphs with edge-connectivity 2

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