The following pages link to Critical concepts in domination (Q2277481):
Displaying 39 items.
- Domination stability in graphs (Q279207) (← links)
- Bicritical domination and double coalescence of graphs (Q313728) (← links)
- Constructing connected bicritical graphs with edge-connectivity 2 (Q412347) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- Some notes on domination edge critical graphs (Q544890) (← links)
- The maximum diameter of total domination edge-critical graphs (Q658066) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Properties of total domination edge-critical graphs (Q968121) (← links)
- On an open problem concerning total domination critical graphs (Q996998) (← links)
- Topics on domination (Q1188929) (← links)
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) (Q1283070) (← links)
- Some properties of 3-domination-critical graphs (Q1301830) (← links)
- The diversity of domination (Q1356420) (← links)
- Local edge domination critical graphs (Q1356421) (← links)
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) (Q1408861) (← links)
- Changing and unchanging domination: A classification (Q1415545) (← links)
- Closure systems and their structure (Q1602560) (← links)
- Total domination stability in graphs (Q1693151) (← links)
- Connected domination critical graphs. (Q1764547) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) (Q2470006) (← links)
- Changing and unchanging of the domination number of a graph (Q2519817) (← links)
- Bicritical domination (Q2581401) (← links)
- Vertex criticality for upper domination and irredundance (Q2746202) (← links)
- Codiameters of 3-connected 3-domination critical graphs (Q2778284) (← 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)
- Varieties of Roman Domination (Q3384116) (← links)
- Multiple Domination (Q3384609) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- On the total domination critical graphs (Q3439417) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- Note: The diameter of edge domination critical graphs (Q4303632) (← links)
- Paired domination stability in graphs (Q5090188) (← links)
- Split Domination Vertex Critical and Edge Critical Graphs (Q5142002) (← links)
- Domatically perfect graphs (Q5154583) (← links)
- Common domination perfect graphs (Q6184333) (← links)
- 4-total domination game critical graphs (Q6637064) (← links)
