Timeline for Does every graph admit an embedding such that identically-colored edges do not cross?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2023 at 16:48 | vote | accept | Tjaden Hess | ||
| Dec 4, 2023 at 18:50 | history | rollback | Tony Huynh |
Rollback to Revision 1
|
|
| Dec 4, 2023 at 18:49 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 94 characters in body
|
| Dec 4, 2023 at 13:36 | comment | added | Tony Huynh | Yes, it makes a difference. Geometric thickness is what the OP is asking about, while thickness is a related but different parameter (since the embeddings do not have to be the same). | |
| Dec 4, 2023 at 11:52 | comment | added | Jukka Kohonen | Does it make a difference if the vertex positions are required to be the same in the two embeddings? This would better match the OP's problem statement. | |
| Dec 4, 2023 at 10:29 | history | answered | Tony Huynh | CC BY-SA 4.0 |