Timeline for Faithfully embeddable graphs
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27, 2012 at 3:15 | answer | added | Igor Rivin | timeline score: 3 | |
| Apr 26, 2012 at 23:04 | answer | added | Felix Goldberg | timeline score: 0 | |
| Apr 26, 2012 at 22:33 | comment | added | Hans-Peter Stricker | @verret. My embeddability criterion is totally different from the one used in defining planarity. My comment about Kuratowski concerns only the two independant ways of characterization. | |
| Apr 26, 2012 at 22:30 | comment | added | Hans-Peter Stricker | @Francois. I hoped it would be clear from the context: the graph is supposed to be complete, there's supposed to be a - weighted - edge between any two nodes. | |
| Apr 26, 2012 at 22:27 | comment | added | verret | What do you mean with your comment about Kuratowski? Some otherwise planar graphs once given weights will NOT be embeddable faithfully in the plane (take the complete graph on 4 vertices with all weights 1). Or did you simply mean the type of characterisation you were looking for (by forbidden minor, etc...)? | |
| Apr 26, 2012 at 22:21 | comment | added | Gjergji Zaimi | mathoverflow.net/questions/12394/… mathoverflow.net/questions/7794/… | |
| Apr 26, 2012 at 22:10 | comment | added | François G. Dorais | Are the weights $\omega_{ij}$ undefined when $ij$ is not an edge in $G$? | |
| Apr 26, 2012 at 22:02 | history | asked | Hans-Peter Stricker | CC BY-SA 3.0 |