Timeline for Injection of Catalan objects into 3-connected planar graphs
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2023 at 13:12 | history | edited | Martin Rubey | CC BY-SA 4.0 |
fix off-by-one error
|
| Nov 17, 2023 at 12:50 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Nov 17, 2023 at 12:48 | history | edited | Martin Rubey | CC BY-SA 4.0 |
deleted 92 characters in body
|
| Nov 17, 2023 at 12:37 | history | edited | Martin Rubey | CC BY-SA 4.0 |
add a refinement
|
| Nov 17, 2023 at 12:28 | history | edited | Martin Rubey | CC BY-SA 4.0 |
add a refinement
|
| Nov 16, 2023 at 20:10 | comment | added | Martin Rubey | Yes, I meant with the adjustment. If the root vertex and it's two neighbors in the n-gon form a triangle, the adjusted cone construction is not three connected. | |
| Nov 16, 2023 at 19:56 | comment | added | Martin Rubey | A000944 is counting isomorphism classes, i.e., unlabelled graphs. | |
| Nov 16, 2023 at 19:55 | comment | added | Sam Hopkins | @MartinRubey: why is it non-injective? Is A000944 counting labeled graphs, or isomorphism classes of graphs? | |
| Nov 16, 2023 at 19:52 | comment | added | Martin Rubey | Yes, but I think that this is not injective. Perhaps it works if we join the cone vertex to all the original vertices except the root? | |
| Nov 16, 2023 at 18:21 | comment | added | Sam Hopkins | Can you do the following: take a triangulation of an n-gon and then add a cone vertex (a vertex connected to all the other ones), to get a 3-connected planar graph? | |
| Nov 16, 2023 at 18:01 | comment | added | Per Alexandersson | My prev. answer did not take planarity into consideration - I somehow missed that condition. | |
| Nov 16, 2023 at 10:14 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
edited tags; edited title
|
| Nov 16, 2023 at 9:54 | history | asked | Martin Rubey | CC BY-SA 4.0 |