meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | May 8 at 5:39 | |
| stats | profile views | 86 |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @EuYu Maybe you know how to prove that $G^2$ from the first item from your offering isn't Hamiltonian Graph? |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @EuYu Big example :) Nice link! It's pitty that I have no acces to example for 2 and 4 item. But thanks anyway! |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @EuYu What is the offering? :) |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @EuYu About the first item: Graph $G$ without bridges (can have points of articulation) and bi-connected graph (can not have points of articulation) it is different definitions. |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @EuYu Can you see the picture for "On Minimal Non-Hamiltonian Locally Hamiltonian Graphs"? |
|
Nov 30 |
comment |
Questions about Hamiltonian Graph @BrianM.Scott Yep |
|
Nov 30 |
asked | Questions about Hamiltonian Graph |
|
Oct 27 |
awarded | Enthusiast |
|
Oct 26 |
accepted | In three-connected graph $G = (V, E)$ $\forall a,b,c \in V \Rightarrow a,b,c \in C$, where $C$ is simple cycle. |
|
Oct 26 |
accepted | For which $n$ is the graph $C^2_n$ planar? |
|
Oct 26 |
comment |
For which $n$ is the graph $C^2_n$ planar? No. The first approach is fine, but for me more comfortable when I see the more stronger proof. Thank you very much! Accept. |
|
Oct 26 |
accepted | If $G$ is a tree and $\forall v_1, v_2 : dist(v_1, v_2)$ is even, where $v_1, v_2-$ are leaves $\Rightarrow \exists!$ a maximal independent set. |
|
Oct 26 |
comment |
If $G$ is a tree and $\forall v_1, v_2 : dist(v_1, v_2)$ is even, where $v_1, v_2-$ are leaves $\Rightarrow \exists!$ a maximal independent set. Yep. This is perfect. Thank you very much. |
|
Oct 26 |
comment |
For which $n$ is the graph $C^2_n$ planar? Why $S_1$ and $S_2$ are disjoint, they have a common edges... And for me $S_1$ doesn't separate $n-1$ from $n-3$.. For me now, the proof does not look strong, maybe we can find $K_{3,3}$.. I'm sorry again, but anyway it is useful +1. |
|
Oct 26 |
comment |
For which $n$ is the graph $C^2_n$ planar? Hm.. Ok. I'm not sure but I will think about your suggestion. |
|
Oct 25 |
comment |
For which $n$ is the graph $C^2_n$ planar? I did not pay attention to the description of my question. Most of all I wanted to get a hint for an odd number. Next time, I'll record all the calculations that I have. I'm sorry. |
|
Oct 25 |
revised |
For which $n$ is the graph $C^2_n$ planar? added 44 characters in body |
|
Oct 25 |
comment |
For which $n$ is the graph $C^2_n$ planar? Yep, thanks a lot. Sorry for my comments. I just meant that for even it's simple. |
|
Oct 25 |
comment |
For which $n$ is the graph $C^2_n$ planar? Yep, but the question is about, for which $n$ is also not planar? Probably for some not even $n$ is planar too.. |
|
Oct 25 |
asked | For which $n$ is the graph $C^2_n$ planar? |
