Timeline for Graph homomorphisms and line graph
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2015 at 4:10 | answer | added | David Roberson | timeline score: 8 | |
| Oct 4, 2015 at 16:43 | vote | accept | Dominic van der Zypen | ||
| Oct 3, 2015 at 14:06 | history | edited | Tony Huynh |
Changed 'graph' tag to 'graph-theory' tag. Also added graph colouring tag.
|
|
| Oct 3, 2015 at 12:21 | answer | added | Gordon Royle | timeline score: 8 | |
| Oct 2, 2015 at 13:10 | answer | added | Patrik | timeline score: 1 | |
| Oct 2, 2015 at 9:33 | answer | added | Tony Huynh | timeline score: 4 | |
| Oct 2, 2015 at 9:21 | comment | added | Tony Huynh | @ShahroozJanbaz $L(G)$ and $L(H)$ are in homomorphism relation since there is a homomorphism from $K_1$ to $K_3$. | |
| Oct 1, 2015 at 11:44 | comment | added | Shahrooz | Let $G=K_3$, the complete graph with three vertices and $H=K_2$. Then $G$ and $H$ is in homomorphism relation. But, $L(G)=G$ and $L(H)=K_1$. If these two latter graphs be in homomorphism relation, then we must have a loop in $L(H)$, which is impossible. I think, if there is at least one edge in $L(G)$ and $L(H)$, your answer is true, | |
| Oct 1, 2015 at 9:11 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |