The following pages link to Domination critical graphs (Q5917319):
Displayed 45 items.
- Constructing connected bicritical graphs with edge-connectivity 2 (Q412347) (← links)
- Perfect matchings in paired domination vertex critical graphs (Q437060) (← links)
- New results on 3-domination critical graphs (Q443927) (← links)
- Some notes on domination edge critical graphs (Q544890) (← links)
- The maximum diameter of total domination edge-critical graphs (Q658066) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← 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)
- The structure of \(4-\gamma \)-critical graphs with a cut vertex (Q708397) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Domination dot-critical graphs (Q817744) (← links)
- Properties of total domination edge-critical graphs (Q968121) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Codiameters of 3-domination critical graphs with toughness more than one (Q1011778) (← links)
- Paired domination vertex critical graphs (Q1014834) (← links)
- An extremal problem for edge domination insensitive graphs (Q1099185) (← links)
- Maximum number of edges in connected graphs with a given domination number (Q1174141) (← links)
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) (Q1283070) (← links)
- Some properties of 3-domination-critical graphs (Q1301830) (← links)
- Local edge domination critical graphs (Q1356421) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) (Q1408861) (← links)
- Some results related to the toughness of 3-domination critical graphs (Q1415537) (← links)
- Changing and unchanging domination: A classification (Q1415545) (← links)
- Matching properties in domination critical graphs. (Q1426104) (← links)
- Connected domination critical graphs. (Q1764547) (← links)
- Changing and unchanging of the radius of a graph (Q1805308) (← links)
- A new proof of Wojcicka's conjecture (Q1811074) (← links)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\) (Q1864591) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical (Q1959715) (← links)
- Critical concepts in domination (Q2277481) (← links)
- 3-factor-criticality in domination critical graphs (Q2462368) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Matching properties in connected domination critical graphs (Q2470003) (← links)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) (Q2470006) (← links)
- On the spectral radius of graphs with a given domination number (Q2479498) (← links)
- Distance domination-critical graphs (Q2483152) (← links)
- Changing and unchanging of the domination number of a graph (Q2519817) (← links)
- Bicritical domination (Q2581401) (← links)
- Codiameters of 3-connected 3-domination critical graphs (Q2778284) (← links)
- Weakly connected domination stable trees (Q3070109) (← links)
- Hamiltonian properties of domination-critical graphs (Q3480081) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)