The following pages link to Graphs of separability at most 2 (Q415268):
Displayed 9 items.
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (Q4632025) (← links)
- The expansion of polynomial invariants for $2$-decompositions of generalized graphs (Q4990131) (← links)
- (Q5214197) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Algorithmic results on locating-total domination in graphs (Q6157416) (← links)