Vertex domination‐critical graphs
From MaRDI portal
Publication:4698232
DOI10.1002/NET.3230250203zbMATH Open0820.05038OpenAlexW2080489554MaRDI QIDQ4698232FDOQ4698232
Gary MacGillivray, D. 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
Cited In (27)
- Domination Critical Semigraphs
- Certified domination
- Factor-critical property in 3-dominating-critical graphs
- Title not available (Why is that?)
- Connected Domination
- A characterization of domination weak bicritical graphs with large diameter
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
- Perfect matchings in paired domination vertex critical graphs
- Graceful labeling for mushroom trees
- Paired domination vertex critical graphs
- The diameter of total domination vertex critical graphs
- Matchings in 3-vertex-critical graphs: the odd case
- Reducing the domination number of graphs via edge contractions and vertex deletions
- On the diameter of total domination vertex-critical graphs
- On bondage numbers of graphs: a survey with some comments
- Title not available (Why is that?)
- Changing and unchanging domination: A classification
- EveryK1,7andK1,3-free, 3-vertex critical graph of even order has a perfect matching
- Bicritical domination
- Title not available (Why is that?)
- Eternal domination: criticality and reachability
- Upper bounds on the diameter of domination dot-critical graphs with given connectivity
- Distance domination-critical graphs
- Minimum 2-tuple dominating set of an interval graph
- Domatically perfect graphs
- Vertex criticality for upper domination and irredundance
- The diameter of paired-domination vertex critical graphs
Recommendations
This page was built for publication: Vertex domination‐critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698232)
