The following pages link to Vertex domination‐critical graphs (Q4698232):
Displaying 24 items.
- Perfect matchings in paired domination vertex critical graphs (Q437060) (← links)
- Eternal domination: criticality and reachability (Q505466) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- On the diameter of total domination vertex-critical graphs (Q726510) (← links)
- Matchings in 3-vertex-critical graphs: the odd case (Q879342) (← links)
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs (Q989762) (← links)
- Factor-critical property in 3-dominating-critical graphs (Q1011779) (← links)
- Paired domination vertex critical graphs (Q1014834) (← links)
- Changing and unchanging domination: A classification (Q1415545) (← links)
- A characterization of domination weak bicritical graphs with large diameter (Q1756048) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Graceful labeling for mushroom trees (Q2350272) (← links)
- Upper bounds on the diameter of domination dot-critical graphs with given connectivity (Q2444534) (← links)
- Distance domination-critical graphs (Q2483152) (← links)
- Bicritical domination (Q2581401) (← links)
- Vertex criticality for upper domination and irredundance (Q2746202) (← links)
- Every<i>K</i><sub>1,7</sub>and<i>K</i><sub>1,3</sub>-free, 3-vertex critical graph of even order has a perfect matching (Q3008565) (← links)
- Connected Domination (Q3384607) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- (Q4622631) (← links)
- Certified domination (Q5154565) (← links)
- Domatically perfect graphs (Q5154583) (← links)
