Jump to content

String graph: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

15 July 2025

29 June 2025

9 June 2025

27 May 2025

19 May 2025

18 May 2025

12 May 2025

14 April 2025

15 March 2025

14 March 2025

25 September 2024

12 August 2024

16 July 2024

6 May 2024

29 January 2023

23 December 2022

22 December 2022

10 December 2022

  • curprev 11:5511:55, 10 December 2022 Dodo0303 talk contribs m 9,870 bytes −78 There is no need to restrict the set of strings to a set where no three strings intersect at the same point. Actually, the proof that Kn is a string graph is by made using n strings that intersect in one single point. undo

6 December 2022

6 July 2022

24 October 2021

20 September 2021

5 July 2021

12 October 2020

7 June 2020

14 April 2020

27 January 2020

14 July 2018

20 June 2018

24 July 2017

25 April 2017

28 September 2015

24 March 2015

22 March 2015

3 May 2014

15 December 2013

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)