The following pages link to On the separability of graphs (Q1942674):
Displaying 13 items.
- On one test for the switching separability of graphs modulo \(q\) (Q299150) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Completely separable graphs (Q908944) (← links)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- On the number of edges of separated multigraphs (Q2151445) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- On a connection between the switching separability of a graph and that of its subgraphs (Q3115214) (← links)
- Separation index of a graph (Q3150175) (← links)
- Path Separability of Graphs (Q3587357) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs (Q5189514) (← links)
- On seed graphs with more than two components (Q5936022) (← links)
