The following pages link to Vertex domination-critical graphs (Q3807242):
Displaying 50 items.
- Domination stability in graphs (Q279207) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- Constructing connected bicritical graphs with edge-connectivity 2 (Q412347) (← links)
- Perfect matchings in paired domination vertex critical graphs (Q437060) (← links)
- Eternal domination: criticality and reachability (Q505466) (← links)
- Total domination dot-critical graphs (Q617644) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- Extremal graphs domination insensitive to the removal of \(k\) edges (Q686272) (← links)
- Graphs whose vertex independence number is unaffected by single edge addition or deletion (Q689974) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Domination dot-critical graphs (Q817744) (← links)
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent (Q868329) (← links)
- Matchings in 3-vertex-critical graphs: the odd case (Q879342) (← links)
- Domination game critical graphs (Q891326) (← links)
- Domination criticality in product graphs (Q896090) (← 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)
- On total domination vertex critical graphs of high connectivity (Q1026168) (← links)
- An extremal problem for edge domination insensitive graphs (Q1099185) (← links)
- A counterexample to a conjecture on the bondage number of a graph (Q1313887) (← links)
- New results about the bondage number of a graph (Q1363706) (← links)
- Changing and unchanging domination: A classification (Q1415545) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Total domination stability in graphs (Q1693151) (← links)
- A characterization of domination weak bicritical graphs with large diameter (Q1756048) (← links)
- On domination game stable graphs and domination game edge-critical graphs (Q1801043) (← links)
- Changing and unchanging of the radius of a graph (Q1805308) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- Nordhaus-Gaddum inequalities for domination in graphs (Q1923485) (← links)
- Coalescence and criticality of graphs (Q1945953) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- On the critical difference of almost bipartite graphs (Q2159389) (← links)
- Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098) (← links)
- Distance domination-critical graphs (Q2483152) (← links)
- Changing and unchanging of the domination number of a graph (Q2519817) (← links)
- Bicritical domination (Q2581401) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- Vertex criticality for upper domination and irredundance (Q2746202) (← links)
- Graph Critical With Respect To Independent Domination (Q2831787) (← 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)
- Paired Domination in Graphs (Q3384606) (← links)
- Connected Domination (Q3384607) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- (Q3417299) (← links)
- Domination Critical Semigraphs (Q3439053) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)
