Timeline for Gauss-Bonnet Theorem for Graphs?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2021 at 1:24 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 18 characters in body; edited tags
|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Mar 22, 2017 at 9:44 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image links broken; now fixed.
|
| Jan 22, 2013 at 15:37 | comment | added | Hans-Peter Stricker | @Joseph: Are you explicitly interested in general graphs - including trees or the graph shown above - or is it OK to consider specific families of graphs, e.g. polyhedral graphs? (I believe that it is possible to have a purely combinatorial interpretation of Gauss-Bonnet for polyhedral graphs, independent of a specific embedding.) | |
| Nov 28, 2011 at 1:41 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 37 characters in body
|
| Nov 28, 2011 at 1:12 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Addendum pointing to new paper on the topic.
|
| Mar 25, 2011 at 12:17 | answer | added | Oliver | timeline score: 6 | |
| May 30, 2010 at 10:19 | vote | accept | Joseph O'Rourke | ||
| May 28, 2010 at 16:27 | answer | added | Tony Huynh | timeline score: 9 | |
| May 28, 2010 at 15:09 | comment | added | Joseph O'Rourke | Yes, that is what I meant, your precision is much preferable to my off-hand way of expressing it. | |
| May 28, 2010 at 14:49 | comment | added | S. Carnahan♦ | When you say "embeds the graph in a manifold", do you mean "embeds the graph in a compact surface so that its complement is a disjoint union of disks"? I am having trouble seeing how this would work in a more general situation. | |
| May 28, 2010 at 13:39 | answer | added | Benoît Kloeckner | timeline score: 19 | |
| May 28, 2010 at 12:49 | history | asked | Joseph O'Rourke | CC BY-SA 2.5 |