Vertex domination‐critical graphs
From MaRDI portal
Publication:4698232
DOI10.1002/net.3230250203zbMath0820.05038OpenAlexW2080489554MaRDI QIDQ4698232
Gary MacGillivray, Denis Hanson, Jason Fulman
Publication date: 14 May 1995
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230250203
Related Items (24)
The diameter of total domination vertex critical graphs ⋮ Matchings in 3-vertex-critical graphs: the odd case ⋮ Perfect matchings in paired domination vertex critical graphs ⋮ Changing and unchanging domination: A classification ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Upper bounds on the diameter of domination dot-critical graphs with given connectivity ⋮ Reducing the domination number of graphs via edge contractions and vertex deletions ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ EveryK1,7andK1,3-free, 3-vertex critical graph of even order has a perfect matching ⋮ Certified domination ⋮ Domatically perfect graphs ⋮ Eternal domination: criticality and reachability ⋮ Vertex criticality for upper domination and irredundance ⋮ A characterization of domination weak bicritical graphs with large diameter ⋮ Distance domination-critical graphs ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ On the diameter of total domination vertex-critical graphs ⋮ The diameter of paired-domination vertex critical graphs ⋮ Factor-critical property in 3-dominating-critical graphs ⋮ Paired domination vertex critical graphs ⋮ Connected Domination ⋮ Unnamed Item ⋮ Bicritical domination ⋮ Graceful labeling for mushroom trees
This page was built for publication: Vertex domination‐critical graphs
