Timeline for Non-separable simple connected graphs.
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2013 at 15:25 | comment | added | Alexey Kvashchuk | thank you. I am looking at a non-special case. Just a simple and connected graph. Given the example above I wonder if there are any other features (like Hamiltonian property) that imply non-separability. May be something in terms of, say, min/max degree (δ(G),Δ(G)). There are some results on the upper bound of the number of cut vertices in terms of δ(G)/Δ(G) but none are directly useful as I am interested in the case of zero cut vertices. | |
| Feb 6, 2013 at 12:33 | history | answered | vb le | CC BY-SA 3.0 |